./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-loops/overflow_1-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-loops/overflow_1-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd15e6a5481e5709ee106d67fec16050e066e3720bb675b6df23302700c97f29 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:37:21,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:37:21,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:37:21,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:37:21,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:37:21,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:37:21,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:37:21,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:37:21,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:37:21,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:37:21,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:37:21,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:37:21,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:37:21,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:37:21,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:37:21,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:37:21,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:37:21,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:37:21,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:37:21,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:37:21,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:37:21,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:37:21,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:37:21,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:37:21,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:37:21,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:37:21,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:37:21,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:37:21,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:37:21,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:37:21,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:37:21,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:37:21,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:37:21,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:37:21,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:37:21,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:37:21,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:37:21,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:37:21,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:37:21,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:37:21,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:37:21,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:37:21,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:37:21,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:37:21,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:37:21,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:37:21,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:37:21,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:37:21,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:37:21,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:37:21,801 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:37:21,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:37:21,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:37:21,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:37:21,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:37:21,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:37:21,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:37:21,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:37:21,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:37:21,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:37:21,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:37:21,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:37:21,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:37:21,820 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:37:21,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:37:21,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:37:21,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd15e6a5481e5709ee106d67fec16050e066e3720bb675b6df23302700c97f29 [2022-02-20 14:37:22,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:37:22,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:37:22,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:37:22,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:37:22,103 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:37:22,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/overflow_1-2.c [2022-02-20 14:37:22,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb42a0e26/6941e35e109d41d6b591bf8bdeb97497/FLAG3391da89a [2022-02-20 14:37:22,529 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:37:22,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/overflow_1-2.c [2022-02-20 14:37:22,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb42a0e26/6941e35e109d41d6b591bf8bdeb97497/FLAG3391da89a [2022-02-20 14:37:22,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb42a0e26/6941e35e109d41d6b591bf8bdeb97497 [2022-02-20 14:37:22,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:37:22,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:37:22,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:37:22,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:37:22,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:37:22,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa8c219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22, skipping insertion in model container [2022-02-20 14:37:22,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:37:22,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:37:22,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/overflow_1-2.c[324,337] [2022-02-20 14:37:22,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:37:22,720 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:37:22,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/overflow_1-2.c[324,337] [2022-02-20 14:37:22,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:37:22,739 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:37:22,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22 WrapperNode [2022-02-20 14:37:22,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:37:22,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:37:22,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:37:22,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:37:22,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,767 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 23 [2022-02-20 14:37:22,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:37:22,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:37:22,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:37:22,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:37:22,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:37:22,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:37:22,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:37:22,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:37:22,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (1/1) ... [2022-02-20 14:37:22,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:37:22,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:22,815 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-02-20 14:37:22,831 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-02-20 14:37:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:37:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:37:22,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:37:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:37:22,921 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:37:22,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:37:23,037 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:37:23,057 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:37:23,057 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:37:23,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:37:23 BoogieIcfgContainer [2022-02-20 14:37:23,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:37:23,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:37:23,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:37:23,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:37:23,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:37:22" (1/3) ... [2022-02-20 14:37:23,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd5a196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:37:23, skipping insertion in model container [2022-02-20 14:37:23,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:22" (2/3) ... [2022-02-20 14:37:23,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd5a196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:37:23, skipping insertion in model container [2022-02-20 14:37:23,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:37:23" (3/3) ... [2022-02-20 14:37:23,064 INFO L111 eAbstractionObserver]: Analyzing ICFG overflow_1-2.c [2022-02-20 14:37:23,067 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:37:23,068 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:37:23,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:37:23,118 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:37:23,118 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:37:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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-02-20 14:37:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 14:37:23,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:23,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 14:37:23,143 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 14:37:23,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:23,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538597860] [2022-02-20 14:37:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:23,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {14#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14#true} is VALID [2022-02-20 14:37:23,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {14#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {16#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:23,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {15#false} is VALID [2022-02-20 14:37:23,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {15#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {15#false} is VALID [2022-02-20 14:37:23,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {15#false} assume 0 == __VERIFIER_assert_~cond#1; {15#false} is VALID [2022-02-20 14:37:23,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {15#false} assume !false; {15#false} is VALID [2022-02-20 14:37:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:23,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:23,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538597860] [2022-02-20 14:37:23,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538597860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:37:23,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:37:23,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:37:23,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436271569] [2022-02-20 14:37:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:37:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2022-02-20 14:37:23,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:23,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-20 14:37:23,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:23,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:37:23,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:37:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:37:23,438 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-20 14:37:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:23,493 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 14:37:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:37:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2022-02-20 14:37:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-20 14:37:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 14:37:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-20 14:37:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 14:37:23,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 14:37:23,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:23,534 INFO L225 Difference]: With dead ends: 20 [2022-02-20 14:37:23,534 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 14:37:23,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:37:23,540 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:23,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:37:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 14:37:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 14:37:23,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:23,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-20 14:37:23,561 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-20 14:37:23,561 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-20 14:37:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:23,564 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 14:37:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 14:37:23,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:23,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:23,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 14:37:23,566 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 14:37:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:23,567 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 14:37:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 14:37:23,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:23,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:23,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:23,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-20 14:37:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 14:37:23,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 14:37:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:23,576 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 14:37:23,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-20 14:37:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 14:37:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 14:37:23,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:23,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:23,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:37:23,580 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-02-20 14:37:23,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:23,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766924555] [2022-02-20 14:37:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:23,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {69#true} is VALID [2022-02-20 14:37:23,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {71#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:23,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {71#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {72#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:23,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {72#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {70#false} is VALID [2022-02-20 14:37:23,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {70#false} is VALID [2022-02-20 14:37:23,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#false} assume 0 == __VERIFIER_assert_~cond#1; {70#false} is VALID [2022-02-20 14:37:23,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {70#false} assume !false; {70#false} is VALID [2022-02-20 14:37:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:23,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:23,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766924555] [2022-02-20 14:37:23,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766924555] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:23,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162412012] [2022-02-20 14:37:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:23,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:23,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:23,720 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-02-20 14:37:23,721 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-02-20 14:37:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:23,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:37:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:23,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:24,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {69#true} is VALID [2022-02-20 14:37:24,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {71#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {71#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {82#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {70#false} is VALID [2022-02-20 14:37:24,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {70#false} is VALID [2022-02-20 14:37:24,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#false} assume 0 == __VERIFIER_assert_~cond#1; {70#false} is VALID [2022-02-20 14:37:24,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {70#false} assume !false; {70#false} is VALID [2022-02-20 14:37:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:24,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:24,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {70#false} assume !false; {70#false} is VALID [2022-02-20 14:37:24,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#false} assume 0 == __VERIFIER_assert_~cond#1; {70#false} is VALID [2022-02-20 14:37:24,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {70#false} is VALID [2022-02-20 14:37:24,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {104#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 >= 10); {70#false} is VALID [2022-02-20 14:37:24,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {104#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} is VALID [2022-02-20 14:37:24,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {108#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:24,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {69#true} is VALID [2022-02-20 14:37:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:24,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162412012] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:24,053 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:24,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:37:24,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103747464] [2022-02-20 14:37:24,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:24,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 7 [2022-02-20 14:37:24,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:24,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-02-20 14:37:24,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:24,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:37:24,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:37:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:37:24,064 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-02-20 14:37:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,120 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 14:37:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:37:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 7 [2022-02-20 14:37:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-02-20 14:37:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-02-20 14:37:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-02-20 14:37:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-02-20 14:37:24,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-02-20 14:37:24,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:24,136 INFO L225 Difference]: With dead ends: 15 [2022-02-20 14:37:24,136 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 14:37:24,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:37:24,137 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:24,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:37:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 14:37:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 14:37:24,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:24,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 14:37:24,145 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 14:37:24,145 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 14:37:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,146 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 14:37:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 14:37:24,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:24,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:24,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 11 states. [2022-02-20 14:37:24,147 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 11 states. [2022-02-20 14:37:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,148 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 14:37:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 14:37:24,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:24,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:24,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:24,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 14:37:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 14:37:24,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-02-20 14:37:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:24,150 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 14:37:24,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-02-20 14:37:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 14:37:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:37:24,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:24,151 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:24,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:37:24,373 WARN L452 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-02-20 14:37:24,374 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-02-20 14:37:24,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:24,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727664626] [2022-02-20 14:37:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:24,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {174#true} is VALID [2022-02-20 14:37:24,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {176#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {177#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {178#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {178#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {179#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {180#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {175#false} is VALID [2022-02-20 14:37:24,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 14:37:24,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:37:24,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:37:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:24,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:24,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727664626] [2022-02-20 14:37:24,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727664626] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:24,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015256294] [2022-02-20 14:37:24,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:37:24,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:24,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:24,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:37:24,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:37:24,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:37:24,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:37:24,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 14:37:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:24,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:24,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {174#true} is VALID [2022-02-20 14:37:24,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {176#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {177#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {178#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {178#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {179#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {199#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:24,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {175#false} is VALID [2022-02-20 14:37:24,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 14:37:24,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:37:24,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:37:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:24,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:24,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 14:37:24,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 14:37:24,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 14:37:24,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 >= 10); {175#false} is VALID [2022-02-20 14:37:24,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {221#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} is VALID [2022-02-20 14:37:24,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {225#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:24,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {233#(<= 10 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {229#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))} is VALID [2022-02-20 14:37:24,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {233#(<= 10 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:24,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {237#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))} is VALID [2022-02-20 14:37:24,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {174#true} is VALID [2022-02-20 14:37:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:24,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015256294] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:24,883 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:24,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:37:24,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818880568] [2022-02-20 14:37:24,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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) Word has length 10 [2022-02-20 14:37:24,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:24,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-02-20 14:37:24,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:24,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:37:24,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:37:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:37:24,905 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-02-20 14:37:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:25,170 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-20 14:37:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:37:25,170 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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) Word has length 10 [2022-02-20 14:37:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-02-20 14:37:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-02-20 14:37:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-02-20 14:37:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-02-20 14:37:25,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-02-20 14:37:25,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:25,199 INFO L225 Difference]: With dead ends: 21 [2022-02-20 14:37:25,199 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 14:37:25,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:37:25,200 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:25,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:37:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 14:37:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 14:37:25,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:25,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-02-20 14:37:25,224 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-02-20 14:37:25,224 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-02-20 14:37:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:25,225 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 14:37:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 14:37:25,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:25,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:25,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2022-02-20 14:37:25,226 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2022-02-20 14:37:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:25,226 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 14:37:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 14:37:25,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:25,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:25,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:25,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-02-20 14:37:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-02-20 14:37:25,228 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-02-20 14:37:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:25,228 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-02-20 14:37:25,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-02-20 14:37:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 14:37:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:37:25,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:25,228 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:25,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:37:25,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:37:25,439 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:25,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2022-02-20 14:37:25,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:25,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554644555] [2022-02-20 14:37:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:25,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:25,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {345#true} is VALID [2022-02-20 14:37:25,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {347#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {348#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {349#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {350#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {351#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {351#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {352#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 14:37:25,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {353#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {354#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-20 14:37:25,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {355#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {356#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {357#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 30 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 30 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {346#false} is VALID [2022-02-20 14:37:25,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {346#false} is VALID [2022-02-20 14:37:25,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#false} assume 0 == __VERIFIER_assert_~cond#1; {346#false} is VALID [2022-02-20 14:37:25,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-02-20 14:37:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:25,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:25,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554644555] [2022-02-20 14:37:25,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554644555] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:25,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509052303] [2022-02-20 14:37:25,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:37:25,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:25,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:25,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:37:25,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:37:25,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:37:25,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:37:25,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 14:37:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:25,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:25,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {345#true} is VALID [2022-02-20 14:37:25,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {347#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {348#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {349#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {350#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {351#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {351#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {352#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 14:37:25,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {353#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {354#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-20 14:37:25,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {355#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:25,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {356#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:26,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {394#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:26,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {346#false} is VALID [2022-02-20 14:37:26,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {346#false} is VALID [2022-02-20 14:37:26,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#false} assume 0 == __VERIFIER_assert_~cond#1; {346#false} is VALID [2022-02-20 14:37:26,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-02-20 14:37:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:26,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:26,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {346#false} assume !false; {346#false} is VALID [2022-02-20 14:37:26,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#false} assume 0 == __VERIFIER_assert_~cond#1; {346#false} is VALID [2022-02-20 14:37:26,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {346#false} is VALID [2022-02-20 14:37:26,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {416#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 >= 10); {346#false} is VALID [2022-02-20 14:37:26,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {416#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} is VALID [2022-02-20 14:37:26,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {420#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:26,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#(<= 10 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {424#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))} is VALID [2022-02-20 14:37:26,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {432#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {428#(<= 10 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:26,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {432#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))} is VALID [2022-02-20 14:37:26,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {440#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {436#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296))} is VALID [2022-02-20 14:37:26,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#(<= 10 (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {440#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))} is VALID [2022-02-20 14:37:26,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {448#(<= 10 (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {444#(<= 10 (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:26,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {452#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {448#(<= 10 (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:26,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {452#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))} is VALID [2022-02-20 14:37:26,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {456#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))} is VALID [2022-02-20 14:37:26,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {345#true} is VALID [2022-02-20 14:37:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:26,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509052303] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:26,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:26,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:37:26,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565858488] [2022-02-20 14:37:26,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:26,313 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) Word has length 16 [2022-02-20 14:37:26,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:26,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-02-20 14:37:26,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:26,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:37:26,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:37:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:37:26,342 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-02-20 14:37:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:27,766 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-02-20 14:37:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 14:37:27,766 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) Word has length 16 [2022-02-20 14:37:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-02-20 14:37:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2022-02-20 14:37:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-02-20 14:37:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2022-02-20 14:37:27,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 44 transitions. [2022-02-20 14:37:27,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:27,844 INFO L225 Difference]: With dead ends: 33 [2022-02-20 14:37:27,844 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 14:37:27,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=340, Invalid=920, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 14:37:27,845 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:27,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 29 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:37:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 14:37:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 14:37:27,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:27,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-02-20 14:37:27,902 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-02-20 14:37:27,902 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-02-20 14:37:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:27,903 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 14:37:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 14:37:27,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:27,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:27,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 29 states. [2022-02-20 14:37:27,904 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 29 states. [2022-02-20 14:37:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:27,905 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 14:37:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 14:37:27,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:27,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:27,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:27,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-02-20 14:37:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-02-20 14:37:27,906 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2022-02-20 14:37:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:27,906 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-02-20 14:37:27,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-02-20 14:37:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 14:37:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:37:27,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:27,907 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:27,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:37:28,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:28,108 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1394044683, now seen corresponding path program 4 times [2022-02-20 14:37:28,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:28,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94444249] [2022-02-20 14:37:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:28,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-02-20 14:37:28,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {652#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {653#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {653#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {654#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {654#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {655#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {656#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {657#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 14:37:28,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {658#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {659#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-20 14:37:28,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {660#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {660#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {661#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {661#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {662#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {662#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {663#(and (<= 32 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 32))} is VALID [2022-02-20 14:37:28,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {663#(and (<= 32 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 32))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {664#(and (<= 34 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 34))} is VALID [2022-02-20 14:37:28,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(and (<= 34 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 34))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {665#(and (<= |ULTIMATE.start_main_~x~0#1| 36) (<= 36 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {665#(and (<= |ULTIMATE.start_main_~x~0#1| 36) (<= 36 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {666#(and (<= |ULTIMATE.start_main_~x~0#1| 38) (<= 38 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {666#(and (<= |ULTIMATE.start_main_~x~0#1| 38) (<= 38 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {667#(and (<= 40 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 40))} is VALID [2022-02-20 14:37:28,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {667#(and (<= 40 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 40))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {668#(and (<= 42 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 42))} is VALID [2022-02-20 14:37:28,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#(and (<= 42 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 42))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {669#(and (<= |ULTIMATE.start_main_~x~0#1| 44) (<= 44 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {669#(and (<= |ULTIMATE.start_main_~x~0#1| 44) (<= 44 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {670#(and (<= 46 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 46))} is VALID [2022-02-20 14:37:28,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#(and (<= 46 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 46))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {671#(and (<= |ULTIMATE.start_main_~x~0#1| 48) (<= 48 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {671#(and (<= |ULTIMATE.start_main_~x~0#1| 48) (<= 48 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {672#(and (<= 50 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 50))} is VALID [2022-02-20 14:37:28,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {672#(and (<= 50 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 50))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {673#(and (<= 52 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 52))} is VALID [2022-02-20 14:37:28,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {673#(and (<= 52 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 52))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {674#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 54 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:28,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {674#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 54 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {651#false} is VALID [2022-02-20 14:37:28,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {651#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {651#false} is VALID [2022-02-20 14:37:28,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#false} assume 0 == __VERIFIER_assert_~cond#1; {651#false} is VALID [2022-02-20 14:37:28,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-02-20 14:37:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:28,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:28,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94444249] [2022-02-20 14:37:28,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94444249] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:28,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135432076] [2022-02-20 14:37:28,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:37:28,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:28,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:28,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:37:28,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:37:28,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:37:28,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:37:28,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-20 14:37:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:28,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:29,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-02-20 14:37:29,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {652#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {653#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {653#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {654#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {654#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {655#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {656#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {657#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 14:37:29,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {658#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {659#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-20 14:37:29,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {660#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {660#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {661#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {661#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {662#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {662#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {663#(and (<= 32 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 32))} is VALID [2022-02-20 14:37:29,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {663#(and (<= 32 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 32))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {664#(and (<= 34 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 34))} is VALID [2022-02-20 14:37:29,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(and (<= 34 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 34))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {665#(and (<= |ULTIMATE.start_main_~x~0#1| 36) (<= 36 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {665#(and (<= |ULTIMATE.start_main_~x~0#1| 36) (<= 36 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {666#(and (<= |ULTIMATE.start_main_~x~0#1| 38) (<= 38 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {666#(and (<= |ULTIMATE.start_main_~x~0#1| 38) (<= 38 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {667#(and (<= 40 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 40))} is VALID [2022-02-20 14:37:29,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {667#(and (<= 40 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 40))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {668#(and (<= 42 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 42))} is VALID [2022-02-20 14:37:29,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#(and (<= 42 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 42))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {669#(and (<= |ULTIMATE.start_main_~x~0#1| 44) (<= 44 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {669#(and (<= |ULTIMATE.start_main_~x~0#1| 44) (<= 44 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {670#(and (<= 46 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 46))} is VALID [2022-02-20 14:37:29,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#(and (<= 46 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 46))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {671#(and (<= |ULTIMATE.start_main_~x~0#1| 48) (<= 48 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:37:29,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {671#(and (<= |ULTIMATE.start_main_~x~0#1| 48) (<= 48 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {672#(and (<= 50 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 50))} is VALID [2022-02-20 14:37:29,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {672#(and (<= 50 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 50))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {673#(and (<= 52 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 52))} is VALID [2022-02-20 14:37:29,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {673#(and (<= 52 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 52))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {747#(and (<= 54 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 54))} is VALID [2022-02-20 14:37:29,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {747#(and (<= 54 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 54))} assume !(main_~x~0#1 % 4294967296 >= 10); {651#false} is VALID [2022-02-20 14:37:29,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {651#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {651#false} is VALID [2022-02-20 14:37:29,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#false} assume 0 == __VERIFIER_assert_~cond#1; {651#false} is VALID [2022-02-20 14:37:29,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-02-20 14:37:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:29,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:30,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-02-20 14:37:30,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#false} assume 0 == __VERIFIER_assert_~cond#1; {651#false} is VALID [2022-02-20 14:37:30,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {651#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {651#false} is VALID [2022-02-20 14:37:30,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {769#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 >= 10); {651#false} is VALID [2022-02-20 14:37:30,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {773#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {769#(<= 10 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} is VALID [2022-02-20 14:37:30,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {777#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {773#(<= 10 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {781#(<= 10 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {777#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))} is VALID [2022-02-20 14:37:30,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {785#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {781#(<= 10 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {789#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {785#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))} is VALID [2022-02-20 14:37:30,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {793#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {789#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296))} is VALID [2022-02-20 14:37:30,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {797#(<= 10 (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {793#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))} is VALID [2022-02-20 14:37:30,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#(<= 10 (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {797#(<= 10 (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {801#(<= 10 (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {809#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {805#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))} is VALID [2022-02-20 14:37:30,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {813#(<= 10 (mod (+ 22 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {809#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))} is VALID [2022-02-20 14:37:30,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {817#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 24) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {813#(<= 10 (mod (+ 22 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {821#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 26) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {817#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 24) 4294967296))} is VALID [2022-02-20 14:37:30,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {825#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 28) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {821#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 26) 4294967296))} is VALID [2022-02-20 14:37:30,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {829#(<= 10 (mod (+ 30 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {825#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 28) 4294967296))} is VALID [2022-02-20 14:37:30,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#(<= 10 (mod (+ 32 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {829#(<= 10 (mod (+ 30 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 34) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {833#(<= 10 (mod (+ 32 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 36) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {837#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 34) 4294967296))} is VALID [2022-02-20 14:37:30,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 38) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {841#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 36) 4294967296))} is VALID [2022-02-20 14:37:30,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {849#(<= 10 (mod (+ 40 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {845#(<= 10 (mod (+ |ULTIMATE.start_main_~x~0#1| 38) 4294967296))} is VALID [2022-02-20 14:37:30,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#(<= 10 (mod (+ 42 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {849#(<= 10 (mod (+ 40 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {857#(<= 10 (mod (+ 44 |ULTIMATE.start_main_~x~0#1|) 4294967296))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {853#(<= 10 (mod (+ 42 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {857#(<= 10 (mod (+ 44 |ULTIMATE.start_main_~x~0#1|) 4294967296))} is VALID [2022-02-20 14:37:30,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-02-20 14:37:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:37:30,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135432076] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:30,141 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:30,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:37:30,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085202577] [2022-02-20 14:37:30,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:30,141 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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) Word has length 28 [2022-02-20 14:37:30,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:30,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 14:37:30,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:30,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:37:30,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:37:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1726, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:37:30,184 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 14:38:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:00,882 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-02-20 14:38:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-20 14:38:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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) Word has length 28 [2022-02-20 14:38:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 14:38:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 80 transitions. [2022-02-20 14:38:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 14:38:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 80 transitions. [2022-02-20 14:38:00,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 80 transitions. [2022-02-20 14:38:01,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:01,068 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:38:01,068 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 14:38:01,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=1264, Invalid=3848, Unknown=0, NotChecked=0, Total=5112 [2022-02-20 14:38:01,070 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:01,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 40 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 14:38:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 14:38:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 14:38:01,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:01,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-02-20 14:38:01,175 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-02-20 14:38:01,175 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-02-20 14:38:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:01,176 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-02-20 14:38:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-02-20 14:38:01,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:01,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:01,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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 53 states. [2022-02-20 14:38:01,177 INFO L87 Difference]: Start difference. First operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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 53 states. [2022-02-20 14:38:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:01,179 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-02-20 14:38:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-02-20 14:38:01,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:01,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:01,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:01,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-02-20 14:38:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-02-20 14:38:01,181 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2022-02-20 14:38:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:01,181 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-02-20 14:38:01,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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-02-20 14:38:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-02-20 14:38:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 14:38:01,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:01,183 INFO L514 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:01,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:38:01,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:38:01,400 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:01,401 INFO L85 PathProgramCache]: Analyzing trace with hash 469964427, now seen corresponding path program 5 times [2022-02-20 14:38:01,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:01,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066355242] [2022-02-20 14:38:01,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:01,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:02,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1219#true} is VALID [2022-02-20 14:38:02,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~x~0#1;main_~x~0#1 := 10; {1221#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1221#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1222#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {1222#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1223#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {1223#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1224#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1225#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {1225#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1226#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 14:38:02,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {1226#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1227#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1228#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-20 14:38:02,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {1228#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1229#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {1229#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1230#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {1230#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1231#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {1231#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1232#(and (<= 32 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 32))} is VALID [2022-02-20 14:38:02,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {1232#(and (<= 32 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 32))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1233#(and (<= 34 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 34))} is VALID [2022-02-20 14:38:02,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(and (<= 34 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 34))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1234#(and (<= |ULTIMATE.start_main_~x~0#1| 36) (<= 36 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {1234#(and (<= |ULTIMATE.start_main_~x~0#1| 36) (<= 36 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1235#(and (<= |ULTIMATE.start_main_~x~0#1| 38) (<= 38 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(and (<= |ULTIMATE.start_main_~x~0#1| 38) (<= 38 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1236#(and (<= 40 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 40))} is VALID [2022-02-20 14:38:02,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {1236#(and (<= 40 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 40))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1237#(and (<= 42 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 42))} is VALID [2022-02-20 14:38:02,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(and (<= 42 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 42))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1238#(and (<= |ULTIMATE.start_main_~x~0#1| 44) (<= 44 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (<= |ULTIMATE.start_main_~x~0#1| 44) (<= 44 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1239#(and (<= 46 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 46))} is VALID [2022-02-20 14:38:02,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {1239#(and (<= 46 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 46))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1240#(and (<= |ULTIMATE.start_main_~x~0#1| 48) (<= 48 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {1240#(and (<= |ULTIMATE.start_main_~x~0#1| 48) (<= 48 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1241#(and (<= 50 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 50))} is VALID [2022-02-20 14:38:02,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {1241#(and (<= 50 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 50))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1242#(and (<= 52 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 52))} is VALID [2022-02-20 14:38:02,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {1242#(and (<= 52 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 52))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1243#(and (<= 54 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 54))} is VALID [2022-02-20 14:38:02,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {1243#(and (<= 54 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 54))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1244#(and (<= |ULTIMATE.start_main_~x~0#1| 56) (<= 56 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {1244#(and (<= |ULTIMATE.start_main_~x~0#1| 56) (<= 56 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1245#(and (<= 58 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 58))} is VALID [2022-02-20 14:38:02,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {1245#(and (<= 58 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 58))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1246#(and (<= |ULTIMATE.start_main_~x~0#1| 60) (<= 60 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {1246#(and (<= |ULTIMATE.start_main_~x~0#1| 60) (<= 60 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1247#(and (<= |ULTIMATE.start_main_~x~0#1| 62) (<= 62 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {1247#(and (<= |ULTIMATE.start_main_~x~0#1| 62) (<= 62 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1248#(and (<= |ULTIMATE.start_main_~x~0#1| 64) (<= 64 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {1248#(and (<= |ULTIMATE.start_main_~x~0#1| 64) (<= 64 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1249#(and (<= |ULTIMATE.start_main_~x~0#1| 66) (<= 66 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {1249#(and (<= |ULTIMATE.start_main_~x~0#1| 66) (<= 66 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1250#(and (<= 68 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 68))} is VALID [2022-02-20 14:38:02,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {1250#(and (<= 68 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 68))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1251#(and (<= |ULTIMATE.start_main_~x~0#1| 70) (<= 70 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {1251#(and (<= |ULTIMATE.start_main_~x~0#1| 70) (<= 70 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1252#(and (<= 72 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 72))} is VALID [2022-02-20 14:38:02,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {1252#(and (<= 72 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 72))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1253#(and (<= |ULTIMATE.start_main_~x~0#1| 74) (<= 74 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {1253#(and (<= |ULTIMATE.start_main_~x~0#1| 74) (<= 74 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1254#(and (<= |ULTIMATE.start_main_~x~0#1| 76) (<= 76 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {1254#(and (<= |ULTIMATE.start_main_~x~0#1| 76) (<= 76 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1255#(and (<= |ULTIMATE.start_main_~x~0#1| 78) (<= 78 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {1255#(and (<= |ULTIMATE.start_main_~x~0#1| 78) (<= 78 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1256#(and (<= 80 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 80))} is VALID [2022-02-20 14:38:02,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {1256#(and (<= 80 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 80))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1257#(and (<= 82 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 82))} is VALID [2022-02-20 14:38:02,942 INFO L290 TraceCheckUtils]: 38: Hoare triple {1257#(and (<= 82 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 82))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1258#(and (<= |ULTIMATE.start_main_~x~0#1| 84) (<= 84 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {1258#(and (<= |ULTIMATE.start_main_~x~0#1| 84) (<= 84 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1259#(and (<= |ULTIMATE.start_main_~x~0#1| 86) (<= 86 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {1259#(and (<= |ULTIMATE.start_main_~x~0#1| 86) (<= 86 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1260#(and (<= 88 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 88))} is VALID [2022-02-20 14:38:02,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {1260#(and (<= 88 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 88))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1261#(and (<= |ULTIMATE.start_main_~x~0#1| 90) (<= 90 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {1261#(and (<= |ULTIMATE.start_main_~x~0#1| 90) (<= 90 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1262#(and (<= 92 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 92))} is VALID [2022-02-20 14:38:02,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {1262#(and (<= 92 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 92))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1263#(and (<= 94 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 94))} is VALID [2022-02-20 14:38:02,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {1263#(and (<= 94 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 94))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1264#(and (<= |ULTIMATE.start_main_~x~0#1| 96) (<= 96 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {1264#(and (<= |ULTIMATE.start_main_~x~0#1| 96) (<= 96 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1265#(and (<= 98 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 98))} is VALID [2022-02-20 14:38:02,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {1265#(and (<= 98 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 98))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1266#(and (<= 100 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 100))} is VALID [2022-02-20 14:38:02,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {1266#(and (<= 100 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 100))} assume !!(main_~x~0#1 % 4294967296 >= 10);main_~x~0#1 := 2 + main_~x~0#1; {1267#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 102 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 14:38:02,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {1267#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) 0) (<= 102 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 10); {1220#false} is VALID [2022-02-20 14:38:02,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {1220#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1220#false} is VALID [2022-02-20 14:38:02,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {1220#false} assume 0 == __VERIFIER_assert_~cond#1; {1220#false} is VALID [2022-02-20 14:38:02,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {1220#false} assume !false; {1220#false} is VALID [2022-02-20 14:38:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:38:02,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:02,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066355242] [2022-02-20 14:38:02,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066355242] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:38:02,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910546592] [2022-02-20 14:38:02,949 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:38:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:38:02,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:38:02,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:38:02,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process