./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sumt4.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loops-crafted-1/sumt4.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31f6a15e3e3cf474f6499516d24c70d4106eeceb ....................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loops-crafted-1/sumt4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31f6a15e3e3cf474f6499516d24c70d4106eeceb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:23:52,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:23:52,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:23:52,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:23:52,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:23:52,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:23:52,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:23:52,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:23:52,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:23:52,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:23:52,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:23:52,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:23:52,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:23:52,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:23:52,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:23:52,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:23:52,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:23:52,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:23:52,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:23:52,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:23:52,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:23:52,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:23:52,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:23:52,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:23:52,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:23:52,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:23:52,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:23:52,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:23:52,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:23:52,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:23:52,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:23:52,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:23:52,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:23:52,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:23:52,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:23:52,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:23:52,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:23:52,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:23:52,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:23:52,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:23:52,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:23:52,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:23:52,945 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:23:52,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:23:52,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:23:52,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:23:52,947 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:23:52,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:23:52,948 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:23:52,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:23:52,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:23:52,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:23:52,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:23:52,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:23:52,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:23:52,950 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:23:52,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:23:52,950 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:23:52,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:23:52,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:23:52,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:23:52,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:23:52,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:23:52,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:23:52,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:23:52,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:23:52,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:23:52,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:23:52,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:23:52,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:23:52,954 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:23:52,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 31f6a15e3e3cf474f6499516d24c70d4106eeceb [2020-07-28 18:23:53,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:23:53,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:23:53,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:23:53,302 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:23:53,303 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:23:53,304 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt4.c [2020-07-28 18:23:53,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca046b18/709962c019964580bd657d7d40fd5c54/FLAG59c795fe9 [2020-07-28 18:23:53,840 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:23:53,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt4.c [2020-07-28 18:23:53,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca046b18/709962c019964580bd657d7d40fd5c54/FLAG59c795fe9 [2020-07-28 18:23:54,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca046b18/709962c019964580bd657d7d40fd5c54 [2020-07-28 18:23:54,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:23:54,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:23:54,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:54,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:23:54,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:23:54,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1983deb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54, skipping insertion in model container [2020-07-28 18:23:54,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:23:54,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:23:54,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:54,511 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:23:54,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:54,551 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:23:54,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54 WrapperNode [2020-07-28 18:23:54,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:54,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:54,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:23:54,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:23:54,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:54,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:23:54,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:23:54,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:23:54,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... [2020-07-28 18:23:54,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:23:54,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:23:54,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:23:54,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:23:54,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:23:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:23:54,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:23:55,033 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:23:55,034 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:23:55,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:55 BoogieIcfgContainer [2020-07-28 18:23:55,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:23:55,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:23:55,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:23:55,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:23:55,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:23:54" (1/3) ... [2020-07-28 18:23:55,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c6ab99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:55, skipping insertion in model container [2020-07-28 18:23:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:54" (2/3) ... [2020-07-28 18:23:55,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c6ab99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:55, skipping insertion in model container [2020-07-28 18:23:55,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:55" (3/3) ... [2020-07-28 18:23:55,047 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt4.c [2020-07-28 18:23:55,058 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:23:55,066 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:23:55,083 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:23:55,113 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:23:55,113 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:23:55,114 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:23:55,114 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:23:55,114 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:23:55,115 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:23:55,115 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:23:55,115 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:23:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-28 18:23:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:23:55,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:23:55,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:23:55,144 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:23:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:23:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1807612808, now seen corresponding path program 1 times [2020-07-28 18:23:55,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:23:55,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149928415] [2020-07-28 18:23:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:23:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:55,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} ~SIZE~0 := 20000001; {19#true} is VALID [2020-07-28 18:23:55,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v4~0 := 0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {19#true} is VALID [2020-07-28 18:23:55,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {19#true} is VALID [2020-07-28 18:23:55,328 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#true} assume !true; {20#false} is VALID [2020-07-28 18:23:55,329 INFO L280 TraceCheckUtils]: 4: Hoare triple {20#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20#false} is VALID [2020-07-28 18:23:55,329 INFO L280 TraceCheckUtils]: 5: Hoare triple {20#false} assume 0 == __VERIFIER_assert_~cond; {20#false} is VALID [2020-07-28 18:23:55,329 INFO L280 TraceCheckUtils]: 6: Hoare triple {20#false} assume !false; {20#false} is VALID [2020-07-28 18:23:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:23:55,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149928415] [2020-07-28 18:23:55,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:23:55,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:23:55,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645504868] [2020-07-28 18:23:55,343 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:23:55,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:23:55,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:23:55,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:55,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:23:55,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:23:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:23:55,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:23:55,385 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2020-07-28 18:23:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:55,450 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2020-07-28 18:23:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:23:55,450 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:23:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:23:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:23:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2020-07-28 18:23:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:23:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2020-07-28 18:23:55,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 30 transitions. [2020-07-28 18:23:55,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:55,540 INFO L225 Difference]: With dead ends: 24 [2020-07-28 18:23:55,541 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:23:55,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:23:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:23:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-28 18:23:55,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:23:55,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-28 18:23:55,585 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:23:55,585 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:23:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:55,588 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-28 18:23:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:23:55,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:55,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:55,589 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:23:55,589 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:23:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:55,592 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-28 18:23:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:23:55,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:55,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:55,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:23:55,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:23:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:23:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-28 18:23:55,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2020-07-28 18:23:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:23:55,598 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-28 18:23:55,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:23:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:23:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:23:55,599 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:23:55,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:23:55,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:23:55,600 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:23:55,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:23:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1806987197, now seen corresponding path program 1 times [2020-07-28 18:23:55,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:23:55,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186261936] [2020-07-28 18:23:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:23:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:55,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:23:55,662 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 18:23:55,670 INFO L168 Benchmark]: Toolchain (without parser) took 1432.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:55,671 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:23:55,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:55,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:55,674 INFO L168 Benchmark]: Boogie Preprocessor took 42.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:23:55,675 INFO L168 Benchmark]: RCFGBuilder took 330.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:55,676 INFO L168 Benchmark]: TraceAbstraction took 626.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:55,680 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 626.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:23:57,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:23:57,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:23:57,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:23:57,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:23:57,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:23:57,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:23:57,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:23:57,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:23:57,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:23:57,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:23:57,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:23:57,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:23:57,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:23:57,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:23:57,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:23:57,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:23:57,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:23:57,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:23:57,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:23:57,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:23:57,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:23:57,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:23:57,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:23:57,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:23:57,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:23:57,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:23:57,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:23:57,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:23:57,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:23:57,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:23:57,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:23:57,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:23:57,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:23:57,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:23:57,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:23:57,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:23:57,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:23:57,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:23:57,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:23:57,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:23:57,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 18:23:57,639 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:23:57,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:23:57,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:23:57,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:23:57,642 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:23:57,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:23:57,642 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:23:57,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:23:57,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:23:57,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:23:57,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:23:57,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:23:57,644 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:23:57,644 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:23:57,645 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:23:57,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:23:57,645 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:23:57,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:23:57,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:23:57,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:23:57,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:23:57,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:23:57,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:23:57,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:23:57,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:23:57,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:23:57,648 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:23:57,648 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:23:57,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:23:57,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:23:57,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:23:57,649 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> 31f6a15e3e3cf474f6499516d24c70d4106eeceb [2020-07-28 18:23:57,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:23:57,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:23:57,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:23:57,992 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:23:57,992 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:23:57,993 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt4.c [2020-07-28 18:23:58,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b612eed3/9d017aa856bb46ab8b72860775acd26f/FLAG61b62841b [2020-07-28 18:23:58,456 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:23:58,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt4.c [2020-07-28 18:23:58,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b612eed3/9d017aa856bb46ab8b72860775acd26f/FLAG61b62841b [2020-07-28 18:23:58,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b612eed3/9d017aa856bb46ab8b72860775acd26f [2020-07-28 18:23:58,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:23:58,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:23:58,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:58,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:23:58,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:23:58,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:58" (1/1) ... [2020-07-28 18:23:58,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777df8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:58, skipping insertion in model container [2020-07-28 18:23:58,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:58" (1/1) ... [2020-07-28 18:23:58,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:23:58,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:23:59,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:59,111 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:23:59,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:59,152 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:23:59,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59 WrapperNode [2020-07-28 18:23:59,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:59,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:59,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:23:59,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:23:59,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:59,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:23:59,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:23:59,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:23:59,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... [2020-07-28 18:23:59,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:23:59,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:23:59,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:23:59,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:23:59,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:23:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:23:59,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:23:59,969 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:23:59,969 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:23:59,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:59 BoogieIcfgContainer [2020-07-28 18:23:59,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:23:59,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:23:59,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:23:59,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:23:59,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:23:58" (1/3) ... [2020-07-28 18:23:59,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19273e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:59, skipping insertion in model container [2020-07-28 18:23:59,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:59" (2/3) ... [2020-07-28 18:23:59,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19273e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:59, skipping insertion in model container [2020-07-28 18:23:59,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:59" (3/3) ... [2020-07-28 18:23:59,982 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt4.c [2020-07-28 18:23:59,993 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:24:00,001 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:24:00,015 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:24:00,036 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:24:00,036 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:24:00,037 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:24:00,037 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:24:00,037 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:24:00,037 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:24:00,038 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:24:00,038 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:24:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-28 18:24:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:24:00,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:24:00,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:24:00,059 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:24:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:24:00,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1807612808, now seen corresponding path program 1 times [2020-07-28 18:24:00,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:24:00,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219280818] [2020-07-28 18:24:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 18:24:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:00,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 18:24:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:00,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:24:00,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} ~SIZE~0 := 20000001bv32; {19#true} is VALID [2020-07-28 18:24:00,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {19#true} is VALID [2020-07-28 18:24:00,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#true} assume !!~bvule32(main_~n~0, ~SIZE~0); {19#true} is VALID [2020-07-28 18:24:00,170 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#true} assume !true; {20#false} is VALID [2020-07-28 18:24:00,171 INFO L280 TraceCheckUtils]: 4: Hoare triple {20#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20#false} is VALID [2020-07-28 18:24:00,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {20#false} assume 0bv32 == __VERIFIER_assert_~cond; {20#false} is VALID [2020-07-28 18:24:00,172 INFO L280 TraceCheckUtils]: 6: Hoare triple {20#false} assume !false; {20#false} is VALID [2020-07-28 18:24:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:00,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:24:00,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {20#false} assume !false; {20#false} is VALID [2020-07-28 18:24:00,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {20#false} assume 0bv32 == __VERIFIER_assert_~cond; {20#false} is VALID [2020-07-28 18:24:00,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {20#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20#false} is VALID [2020-07-28 18:24:00,190 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#true} assume !true; {20#false} is VALID [2020-07-28 18:24:00,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#true} assume !!~bvule32(main_~n~0, ~SIZE~0); {19#true} is VALID [2020-07-28 18:24:00,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {19#true} is VALID [2020-07-28 18:24:00,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} ~SIZE~0 := 20000001bv32; {19#true} is VALID [2020-07-28 18:24:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:00,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219280818] [2020-07-28 18:24:00,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:24:00,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 18:24:00,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741661872] [2020-07-28 18:24:00,200 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:24:00,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:24:00,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:24:00,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:00,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:24:00,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:24:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:24:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:24:00,249 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2020-07-28 18:24:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:00,358 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2020-07-28 18:24:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:24:00,358 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:24:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:24:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:24:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2020-07-28 18:24:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:24:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2020-07-28 18:24:00,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 30 transitions. [2020-07-28 18:24:00,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:00,502 INFO L225 Difference]: With dead ends: 24 [2020-07-28 18:24:00,502 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:24:00,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:24:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:24:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-28 18:24:00,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:24:00,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-28 18:24:00,536 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:24:00,536 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:24:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:00,539 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-28 18:24:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:24:00,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:00,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:00,540 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:24:00,540 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:24:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:00,542 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-28 18:24:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:24:00,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:00,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:00,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:24:00,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:24:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:24:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-28 18:24:00,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2020-07-28 18:24:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:24:00,548 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-28 18:24:00,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:24:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-28 18:24:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:24:00,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:24:00,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:24:00,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:24:00,761 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:24:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:24:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1806987197, now seen corresponding path program 1 times [2020-07-28 18:24:00,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:24:00,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234929179] [2020-07-28 18:24:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:24:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:00,788 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 18:24:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:00,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:24:00,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {125#true} ~SIZE~0 := 20000001bv32; {125#true} is VALID [2020-07-28 18:24:00,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {133#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:00,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {133#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {133#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:00,926 INFO L280 TraceCheckUtils]: 3: Hoare triple {133#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !~bvult32(main_~l~0, main_~n~0); {133#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:00,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {133#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {143#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:24:00,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {143#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {126#false} is VALID [2020-07-28 18:24:00,929 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#false} assume !false; {126#false} is VALID [2020-07-28 18:24:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:00,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:24:01,078 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#false} assume !false; {126#false} is VALID [2020-07-28 18:24:01,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {153#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {126#false} is VALID [2020-07-28 18:24:01,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {157#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {153#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:24:01,082 INFO L280 TraceCheckUtils]: 3: Hoare triple {157#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !~bvult32(main_~l~0, main_~n~0); {157#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:01,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {157#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:01,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {157#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:01,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {125#true} ~SIZE~0 := 20000001bv32; {125#true} is VALID [2020-07-28 18:24:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:01,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234929179] [2020-07-28 18:24:01,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:24:01,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 18:24:01,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479732120] [2020-07-28 18:24:01,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-28 18:24:01,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:24:01,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:24:01,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:01,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:24:01,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:24:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:24:01,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:24:01,118 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 6 states. [2020-07-28 18:24:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:01,766 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-28 18:24:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:24:01,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-28 18:24:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:24:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:24:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2020-07-28 18:24:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:24:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2020-07-28 18:24:01,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2020-07-28 18:24:01,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:01,903 INFO L225 Difference]: With dead ends: 25 [2020-07-28 18:24:01,903 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 18:24:01,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:24:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 18:24:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 18:24:01,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:24:01,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 18:24:01,915 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:24:01,915 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:24:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:01,917 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-28 18:24:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:24:01,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:01,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:01,918 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 18:24:01,919 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 18:24:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:01,921 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-28 18:24:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:24:01,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:01,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:01,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:24:01,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:24:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:24:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-28 18:24:01,927 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2020-07-28 18:24:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:24:01,928 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-28 18:24:01,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:24:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-28 18:24:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:24:01,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:24:01,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:24:02,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:24:02,148 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:24:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:24:02,148 INFO L82 PathProgramCache]: Analyzing trace with hash 87918451, now seen corresponding path program 1 times [2020-07-28 18:24:02,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:24:02,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483140008] [2020-07-28 18:24:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 18:24:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:02,176 WARN L261 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 18:24:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:02,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:24:02,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#true} ~SIZE~0 := 20000001bv32; {243#true} is VALID [2020-07-28 18:24:02,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {251#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:02,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {251#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {251#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:02,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {251#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !!~bvult32(main_~l~0, main_~n~0); {251#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:02,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {251#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {261#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:02,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {261#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {265#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:02,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {265#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !~bvult32(main_~l~0, main_~n~0); {265#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:02,374 INFO L280 TraceCheckUtils]: 7: Hoare triple {265#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {272#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:24:02,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {272#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {244#false} is VALID [2020-07-28 18:24:02,375 INFO L280 TraceCheckUtils]: 9: Hoare triple {244#false} assume !false; {244#false} is VALID [2020-07-28 18:24:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:02,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:24:02,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {244#false} assume !false; {244#false} is VALID [2020-07-28 18:24:02,601 INFO L280 TraceCheckUtils]: 8: Hoare triple {282#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {244#false} is VALID [2020-07-28 18:24:02,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {282#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:24:02,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !~bvult32(main_~l~0, main_~n~0); {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:02,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {293#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:04,438 INFO L280 TraceCheckUtils]: 4: Hoare triple {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {293#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:04,439 INFO L280 TraceCheckUtils]: 3: Hoare triple {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:04,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:04,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {286#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:04,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#true} ~SIZE~0 := 20000001bv32; {243#true} is VALID [2020-07-28 18:24:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:24:04,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483140008] [2020-07-28 18:24:04,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:24:04,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-07-28 18:24:04,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207687388] [2020-07-28 18:24:04,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 18:24:04,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:24:04,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:24:06,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:06,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:24:06,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:24:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:24:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:24:06,369 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2020-07-28 18:24:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:18,417 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-07-28 18:24:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:24:18,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 18:24:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:24:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:24:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 18:24:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:24:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 18:24:18,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 18:24:22,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 25 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:22,547 INFO L225 Difference]: With dead ends: 23 [2020-07-28 18:24:22,548 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 18:24:22,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:24:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 18:24:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-28 18:24:22,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:24:22,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-28 18:24:22,568 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 18:24:22,569 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 18:24:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:22,572 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-28 18:24:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-28 18:24:22,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:22,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:22,573 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 18:24:22,573 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 18:24:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:22,576 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-28 18:24:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-28 18:24:22,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:22,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:24:22,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:24:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:24:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-07-28 18:24:22,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 10 [2020-07-28 18:24:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:24:22,579 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-28 18:24:22,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:24:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-28 18:24:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:24:22,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:24:22,581 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:24:22,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:24:22,782 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:24:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:24:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash -116405439, now seen corresponding path program 1 times [2020-07-28 18:24:22,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:24:22,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009998013] [2020-07-28 18:24:22,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 18:24:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:22,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 18:24:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:22,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:24:22,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {396#true} ~SIZE~0 := 20000001bv32; {396#true} is VALID [2020-07-28 18:24:22,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {396#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:22,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:22,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:22,884 INFO L280 TraceCheckUtils]: 4: Hoare triple {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:22,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {404#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {417#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:22,885 INFO L280 TraceCheckUtils]: 6: Hoare triple {417#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {417#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:22,886 INFO L280 TraceCheckUtils]: 7: Hoare triple {417#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {417#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:22,886 INFO L280 TraceCheckUtils]: 8: Hoare triple {417#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {397#false} is VALID [2020-07-28 18:24:22,887 INFO L280 TraceCheckUtils]: 9: Hoare triple {397#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {397#false} is VALID [2020-07-28 18:24:22,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {397#false} assume !~bvult32(main_~l~0, main_~n~0); {397#false} is VALID [2020-07-28 18:24:22,887 INFO L280 TraceCheckUtils]: 11: Hoare triple {397#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {397#false} is VALID [2020-07-28 18:24:22,888 INFO L280 TraceCheckUtils]: 12: Hoare triple {397#false} assume 0bv32 == __VERIFIER_assert_~cond; {397#false} is VALID [2020-07-28 18:24:22,888 INFO L280 TraceCheckUtils]: 13: Hoare triple {397#false} assume !false; {397#false} is VALID [2020-07-28 18:24:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:22,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:24:23,319 INFO L280 TraceCheckUtils]: 13: Hoare triple {397#false} assume !false; {397#false} is VALID [2020-07-28 18:24:23,320 INFO L280 TraceCheckUtils]: 12: Hoare triple {397#false} assume 0bv32 == __VERIFIER_assert_~cond; {397#false} is VALID [2020-07-28 18:24:23,320 INFO L280 TraceCheckUtils]: 11: Hoare triple {397#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {397#false} is VALID [2020-07-28 18:24:23,320 INFO L280 TraceCheckUtils]: 10: Hoare triple {397#false} assume !~bvult32(main_~l~0, main_~n~0); {397#false} is VALID [2020-07-28 18:24:23,320 INFO L280 TraceCheckUtils]: 9: Hoare triple {397#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {397#false} is VALID [2020-07-28 18:24:23,321 INFO L280 TraceCheckUtils]: 8: Hoare triple {457#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {397#false} is VALID [2020-07-28 18:24:23,321 INFO L280 TraceCheckUtils]: 7: Hoare triple {457#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {457#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:23,322 INFO L280 TraceCheckUtils]: 6: Hoare triple {457#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {457#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:23,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {457#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:23,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2020-07-28 18:24:23,324 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2020-07-28 18:24:23,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume !!~bvule32(main_~n~0, ~SIZE~0); {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2020-07-28 18:24:23,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {396#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {467#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2020-07-28 18:24:23,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {396#true} ~SIZE~0 := 20000001bv32; {396#true} is VALID [2020-07-28 18:24:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:23,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009998013] [2020-07-28 18:24:23,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:24:23,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-28 18:24:23,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117716159] [2020-07-28 18:24:23,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-28 18:24:23,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:24:23,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:24:23,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:23,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:24:23,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:24:23,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:24:23,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:24:23,488 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 6 states. [2020-07-28 18:24:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:26,884 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2020-07-28 18:24:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:24:26,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-28 18:24:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:24:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:24:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-28 18:24:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:24:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-28 18:24:26,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2020-07-28 18:24:27,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:27,265 INFO L225 Difference]: With dead ends: 42 [2020-07-28 18:24:27,265 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 18:24:27,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:24:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 18:24:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2020-07-28 18:24:27,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:24:27,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 23 states. [2020-07-28 18:24:27,280 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 23 states. [2020-07-28 18:24:27,281 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 23 states. [2020-07-28 18:24:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:27,282 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-28 18:24:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-28 18:24:27,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:27,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:27,283 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 28 states. [2020-07-28 18:24:27,284 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 28 states. [2020-07-28 18:24:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:27,290 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-28 18:24:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-28 18:24:27,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:27,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:27,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:24:27,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:24:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 18:24:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-28 18:24:27,294 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2020-07-28 18:24:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:24:27,295 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-28 18:24:27,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:24:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-28 18:24:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 18:24:27,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:24:27,297 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:24:27,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:24:27,510 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:24:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:24:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1873960746, now seen corresponding path program 1 times [2020-07-28 18:24:27,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:24:27,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688960946] [2020-07-28 18:24:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 18:24:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:27,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 18:24:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:27,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:24:27,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {613#true} ~SIZE~0 := 20000001bv32; {613#true} is VALID [2020-07-28 18:24:27,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {613#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {621#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,787 INFO L280 TraceCheckUtils]: 2: Hoare triple {621#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {621#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,788 INFO L280 TraceCheckUtils]: 3: Hoare triple {621#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !!~bvult32(main_~l~0, main_~n~0); {621#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,789 INFO L280 TraceCheckUtils]: 4: Hoare triple {621#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {631#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,789 INFO L280 TraceCheckUtils]: 5: Hoare triple {631#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,790 INFO L280 TraceCheckUtils]: 6: Hoare triple {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !!~bvult32(main_~l~0, main_~n~0); {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,791 INFO L280 TraceCheckUtils]: 7: Hoare triple {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,791 INFO L280 TraceCheckUtils]: 8: Hoare triple {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:27,792 INFO L280 TraceCheckUtils]: 9: Hoare triple {635#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {648#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv1 32) ULTIMATE.start_main_~k~0))} is VALID [2020-07-28 18:24:27,793 INFO L280 TraceCheckUtils]: 10: Hoare triple {648#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv1 32) ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {652#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (_ bv1 32) ULTIMATE.start_main_~k~0))} is VALID [2020-07-28 18:24:27,794 INFO L280 TraceCheckUtils]: 11: Hoare triple {652#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (_ bv1 32) ULTIMATE.start_main_~k~0))} assume !~bvult32(main_~l~0, main_~n~0); {652#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (_ bv1 32) ULTIMATE.start_main_~k~0))} is VALID [2020-07-28 18:24:27,795 INFO L280 TraceCheckUtils]: 12: Hoare triple {652#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (_ bv1 32) ULTIMATE.start_main_~k~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {659#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:24:27,798 INFO L280 TraceCheckUtils]: 13: Hoare triple {659#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {614#false} is VALID [2020-07-28 18:24:27,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {614#false} assume !false; {614#false} is VALID [2020-07-28 18:24:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:27,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:24:28,070 INFO L280 TraceCheckUtils]: 14: Hoare triple {614#false} assume !false; {614#false} is VALID [2020-07-28 18:24:28,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {669#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {614#false} is VALID [2020-07-28 18:24:28,072 INFO L280 TraceCheckUtils]: 12: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {669#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:24:28,072 INFO L280 TraceCheckUtils]: 11: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !~bvult32(main_~l~0, main_~n~0); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:28,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {680#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:30,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {680#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} is UNKNOWN [2020-07-28 18:24:30,100 INFO L280 TraceCheckUtils]: 8: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:30,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:30,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:30,119 INFO L280 TraceCheckUtils]: 5: Hoare triple {680#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:32,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {680#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:32,042 INFO L280 TraceCheckUtils]: 3: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:32,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:32,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {613#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {673#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:32,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {613#true} ~SIZE~0 := 20000001bv32; {613#true} is VALID [2020-07-28 18:24:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 18:24:32,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688960946] [2020-07-28 18:24:32,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:24:32,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2020-07-28 18:24:32,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543668027] [2020-07-28 18:24:32,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 18:24:32,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:24:32,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:24:35,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 12 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:35,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:24:35,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:24:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:24:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:24:35,606 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 5 states. [2020-07-28 18:24:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:44,065 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-28 18:24:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:24:44,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 18:24:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:24:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:24:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 18:24:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:24:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 18:24:44,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 18:24:49,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:49,383 INFO L225 Difference]: With dead ends: 32 [2020-07-28 18:24:49,384 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 18:24:49,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:24:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 18:24:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 18:24:49,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:24:49,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 18:24:49,398 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 18:24:49,398 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 18:24:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:49,400 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-28 18:24:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-28 18:24:49,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:49,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:49,401 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 18:24:49,401 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 18:24:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:49,404 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-28 18:24:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-28 18:24:49,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:49,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:49,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:24:49,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:24:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 18:24:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-28 18:24:49,407 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2020-07-28 18:24:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:24:49,407 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-28 18:24:49,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:24:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-28 18:24:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 18:24:49,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:24:49,409 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:24:49,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 18:24:49,612 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:24:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:24:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1693113352, now seen corresponding path program 1 times [2020-07-28 18:24:49,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:24:49,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925967946] [2020-07-28 18:24:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 18:24:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:49,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:24:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:49,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:24:49,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {838#true} ~SIZE~0 := 20000001bv32; {838#true} is VALID [2020-07-28 18:24:49,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {838#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,734 INFO L280 TraceCheckUtils]: 3: Hoare triple {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,735 INFO L280 TraceCheckUtils]: 4: Hoare triple {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {846#(= (_ bv0 32) ULTIMATE.start_main_~l~0)} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {859#(= (_ bv1 32) ULTIMATE.start_main_~l~0)} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {875#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,739 INFO L280 TraceCheckUtils]: 11: Hoare triple {875#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {875#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:49,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {875#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {839#false} is VALID [2020-07-28 18:24:49,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {839#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {839#false} is VALID [2020-07-28 18:24:49,741 INFO L280 TraceCheckUtils]: 14: Hoare triple {839#false} assume !!~bvult32(main_~l~0, main_~n~0); {839#false} is VALID [2020-07-28 18:24:49,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {839#false} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {839#false} is VALID [2020-07-28 18:24:49,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {839#false} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {839#false} is VALID [2020-07-28 18:24:49,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {839#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {839#false} is VALID [2020-07-28 18:24:49,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {839#false} assume !~bvult32(main_~l~0, main_~n~0); {839#false} is VALID [2020-07-28 18:24:49,742 INFO L280 TraceCheckUtils]: 19: Hoare triple {839#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {839#false} is VALID [2020-07-28 18:24:49,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {839#false} assume 0bv32 == __VERIFIER_assert_~cond; {839#false} is VALID [2020-07-28 18:24:49,743 INFO L280 TraceCheckUtils]: 21: Hoare triple {839#false} assume !false; {839#false} is VALID [2020-07-28 18:24:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:24:49,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:24:49,821 INFO L280 TraceCheckUtils]: 21: Hoare triple {839#false} assume !false; {839#false} is VALID [2020-07-28 18:24:49,821 INFO L280 TraceCheckUtils]: 20: Hoare triple {839#false} assume 0bv32 == __VERIFIER_assert_~cond; {839#false} is VALID [2020-07-28 18:24:49,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {839#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {839#false} is VALID [2020-07-28 18:24:49,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {839#false} assume !~bvult32(main_~l~0, main_~n~0); {839#false} is VALID [2020-07-28 18:24:49,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {839#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {839#false} is VALID [2020-07-28 18:24:49,822 INFO L280 TraceCheckUtils]: 16: Hoare triple {839#false} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {839#false} is VALID [2020-07-28 18:24:49,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {839#false} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {839#false} is VALID [2020-07-28 18:24:49,822 INFO L280 TraceCheckUtils]: 14: Hoare triple {839#false} assume !!~bvult32(main_~l~0, main_~n~0); {839#false} is VALID [2020-07-28 18:24:49,823 INFO L280 TraceCheckUtils]: 13: Hoare triple {839#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {839#false} is VALID [2020-07-28 18:24:49,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {936#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32))))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {839#false} is VALID [2020-07-28 18:24:49,825 INFO L280 TraceCheckUtils]: 11: Hoare triple {936#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {936#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32))))} is VALID [2020-07-28 18:24:49,827 INFO L280 TraceCheckUtils]: 10: Hoare triple {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {936#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32))))} is VALID [2020-07-28 18:24:49,828 INFO L280 TraceCheckUtils]: 9: Hoare triple {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:49,828 INFO L280 TraceCheckUtils]: 8: Hoare triple {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:49,829 INFO L280 TraceCheckUtils]: 7: Hoare triple {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:49,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:49,832 INFO L280 TraceCheckUtils]: 5: Hoare triple {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {943#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:49,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} is VALID [2020-07-28 18:24:49,833 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} is VALID [2020-07-28 18:24:49,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} assume !!~bvule32(main_~n~0, ~SIZE~0); {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} is VALID [2020-07-28 18:24:49,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {838#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {959#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv2 32)) (_ bv4 32))))} is VALID [2020-07-28 18:24:49,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {838#true} ~SIZE~0 := 20000001bv32; {838#true} is VALID [2020-07-28 18:24:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:24:49,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925967946] [2020-07-28 18:24:49,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:24:49,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-28 18:24:49,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815110659] [2020-07-28 18:24:49,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-28 18:24:49,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:24:49,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:24:49,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:49,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:24:49,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:24:49,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:24:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:24:49,973 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 8 states. [2020-07-28 18:24:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:51,115 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2020-07-28 18:24:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 18:24:51,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-28 18:24:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:24:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:24:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2020-07-28 18:24:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:24:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2020-07-28 18:24:51,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2020-07-28 18:24:51,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:24:51,414 INFO L225 Difference]: With dead ends: 81 [2020-07-28 18:24:51,414 INFO L226 Difference]: Without dead ends: 67 [2020-07-28 18:24:51,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:24:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-28 18:24:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2020-07-28 18:24:51,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:24:51,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 53 states. [2020-07-28 18:24:51,456 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 53 states. [2020-07-28 18:24:51,456 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 53 states. [2020-07-28 18:24:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:51,459 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-28 18:24:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-28 18:24:51,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:51,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:51,460 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 67 states. [2020-07-28 18:24:51,461 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 67 states. [2020-07-28 18:24:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:24:51,464 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-28 18:24:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-28 18:24:51,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:24:51,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:24:51,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:24:51,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:24:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-28 18:24:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2020-07-28 18:24:51,468 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 22 [2020-07-28 18:24:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:24:51,468 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2020-07-28 18:24:51,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:24:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2020-07-28 18:24:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-28 18:24:51,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:24:51,469 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:24:51,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 18:24:51,683 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:24:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:24:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2068947229, now seen corresponding path program 1 times [2020-07-28 18:24:51,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:24:51,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557308905] [2020-07-28 18:24:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-07-28 18:24:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:51,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-28 18:24:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:24:51,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:24:52,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {1274#true} ~SIZE~0 := 20000001bv32; {1274#true} is VALID [2020-07-28 18:24:52,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {1274#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {1282#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {1282#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {1282#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {1282#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1282#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {1282#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv0 32) ULTIMATE.start_main_~v4~0))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {1292#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,180 INFO L280 TraceCheckUtils]: 5: Hoare triple {1292#(and (= (_ bv0 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,181 INFO L280 TraceCheckUtils]: 7: Hoare triple {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,182 INFO L280 TraceCheckUtils]: 8: Hoare triple {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:52,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {1296#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~k~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1309#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:52,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {1309#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:52,185 INFO L280 TraceCheckUtils]: 11: Hoare triple {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:52,186 INFO L280 TraceCheckUtils]: 12: Hoare triple {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:52,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-28 18:24:52,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {1313#(and (= (_ bv0 32) ULTIMATE.start_main_~j~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {1326#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:24:52,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {1326#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1330#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:24:52,191 INFO L280 TraceCheckUtils]: 16: Hoare triple {1330#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1330#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:24:52,193 INFO L280 TraceCheckUtils]: 17: Hoare triple {1330#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1330#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:24:52,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {1330#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0))} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {1340#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:24:52,195 INFO L280 TraceCheckUtils]: 19: Hoare triple {1340#(and (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1344#(and (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0) (= (_ bv4 32) ULTIMATE.start_main_~l~0))} is VALID [2020-07-28 18:24:52,196 INFO L280 TraceCheckUtils]: 20: Hoare triple {1344#(and (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0) (= (_ bv4 32) ULTIMATE.start_main_~l~0))} assume !~bvult32(main_~l~0, main_~n~0); {1344#(and (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0) (= (_ bv4 32) ULTIMATE.start_main_~l~0))} is VALID [2020-07-28 18:24:52,197 INFO L280 TraceCheckUtils]: 21: Hoare triple {1344#(and (= (_ bv1 32) ULTIMATE.start_main_~v4~0) (= (bvadd ULTIMATE.start_main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ULTIMATE.start_main_~j~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0) (= (_ bv4 32) ULTIMATE.start_main_~l~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1351#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:24:52,198 INFO L280 TraceCheckUtils]: 22: Hoare triple {1351#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1275#false} is VALID [2020-07-28 18:24:52,198 INFO L280 TraceCheckUtils]: 23: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2020-07-28 18:24:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:24:52,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:24:54,647 INFO L280 TraceCheckUtils]: 23: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2020-07-28 18:24:54,648 INFO L280 TraceCheckUtils]: 22: Hoare triple {1361#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1275#false} is VALID [2020-07-28 18:24:54,649 INFO L280 TraceCheckUtils]: 21: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1361#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:24:54,650 INFO L280 TraceCheckUtils]: 20: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !~bvult32(main_~l~0, main_~n~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:54,670 INFO L280 TraceCheckUtils]: 19: Hoare triple {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:56,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} is UNKNOWN [2020-07-28 18:24:56,680 INFO L280 TraceCheckUtils]: 17: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:56,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:56,699 INFO L280 TraceCheckUtils]: 15: Hoare triple {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:58,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:24:58,637 INFO L280 TraceCheckUtils]: 13: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:58,637 INFO L280 TraceCheckUtils]: 12: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:58,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:24:58,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:00,663 INFO L280 TraceCheckUtils]: 9: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} is UNKNOWN [2020-07-28 18:25:00,663 INFO L280 TraceCheckUtils]: 8: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:00,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:00,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:00,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:02,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {1372#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0))} is VALID [2020-07-28 18:25:02,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:02,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:02,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {1274#true} havoc main_#res;havoc main_#t~nondet0, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {1365#(= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0)} is VALID [2020-07-28 18:25:02,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {1274#true} ~SIZE~0 := 20000001bv32; {1274#true} is VALID [2020-07-28 18:25:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-28 18:25:02,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557308905] [2020-07-28 18:25:02,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:25:02,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2020-07-28 18:25:02,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160062674] [2020-07-28 18:25:02,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-28 18:25:02,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:25:02,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:25:10,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 13 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-28 18:25:10,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:25:10,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:25:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:25:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-07-28 18:25:10,308 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 5 states. [2020-07-28 18:25:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:25:11,008 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2020-07-28 18:25:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:25:11,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-28 18:25:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:25:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:25:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-28 18:25:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:25:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-28 18:25:11,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2020-07-28 18:25:19,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 11 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-28 18:25:19,101 INFO L225 Difference]: With dead ends: 53 [2020-07-28 18:25:19,101 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:25:19,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:25:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:25:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:25:19,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:25:19,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:25:19,103 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:25:19,103 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:25:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:25:19,103 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:25:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:25:19,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:25:19,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:25:19,104 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:25:19,104 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:25:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:25:19,104 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:25:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:25:19,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:25:19,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:25:19,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:25:19,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:25:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:25:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:25:19,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-28 18:25:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:25:19,105 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:25:19,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:25:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:25:19,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:25:19,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-07-28 18:25:19,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:25:19,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:25:19,388 INFO L268 CegarLoopResult]: For program point L25(lines 25 28) no Hoare annotation was computed. [2020-07-28 18:25:19,388 INFO L268 CegarLoopResult]: For program point L23(lines 23 28) no Hoare annotation was computed. [2020-07-28 18:25:19,388 INFO L268 CegarLoopResult]: For program point L25-2(lines 21 28) no Hoare annotation was computed. [2020-07-28 18:25:19,388 INFO L268 CegarLoopResult]: For program point L21(lines 21 28) no Hoare annotation was computed. [2020-07-28 18:25:19,388 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 30) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~v4~0) ULTIMATE.start_main_~l~0) [2020-07-28 18:25:19,389 INFO L268 CegarLoopResult]: For program point L19-3(lines 19 30) no Hoare annotation was computed. [2020-07-28 18:25:19,389 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:25:19,389 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-28 18:25:19,389 INFO L271 CegarLoopResult]: At program point L32(lines 14 33) the Hoare annotation is: true [2020-07-28 18:25:19,389 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:25:19,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:25:19,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:25:19,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:25:19,390 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-28 18:25:19,390 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:25:19,394 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:25:19,394 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:25:19,394 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 18:25:19,395 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:25:19,396 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:25:19,396 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2020-07-28 18:25:19,396 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:25:19,396 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:25:19,396 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:25:19,396 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:25:19,396 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:25:19,397 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:25:19,397 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:25:19,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:25:19 BoogieIcfgContainer [2020-07-28 18:25:19,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:25:19,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:25:19,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:25:19,408 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:25:19,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:59" (3/4) ... [2020-07-28 18:25:19,412 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:25:19,426 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:25:19,427 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:25:19,495 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:25:19,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:25:19,507 INFO L168 Benchmark]: Toolchain (without parser) took 80617.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 957.5 MB in the beginning and 892.4 MB in the end (delta: 65.1 MB). Peak memory consumption was 249.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:25:19,511 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:25:19,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.54 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:25:19,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:25:19,516 INFO L168 Benchmark]: Boogie Preprocessor took 37.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:25:19,517 INFO L168 Benchmark]: RCFGBuilder took 666.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:25:19,517 INFO L168 Benchmark]: TraceAbstraction took 79432.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 191.3 MB). Peak memory consumption was 254.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:25:19,518 INFO L168 Benchmark]: Witness Printer took 88.79 ms. Allocated memory is still 1.2 GB. Free memory is still 892.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:25:19,519 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.54 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 666.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79432.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 191.3 MB). Peak memory consumption was 254.7 MB. Max. memory is 11.5 GB. * Witness Printer took 88.79 ms. Allocated memory is still 1.2 GB. Free memory is still 892.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ~bvadd64(i, j, k, v4) == l - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 79.2s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 45.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 64 SDslu, 76 SDs, 0 SdLazy, 277 SolverSat, 20 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 13 NumberOfFragments, 9 HoareAnnotationTreeSize, 3 FomulaSimplifications, 126 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 21292 SizeOfPredicates, 30 NumberOfNonLiveVariables, 168 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 70/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...