./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested5-1.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/nested5-1.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 a1f0fc7e11527245c3cf532e554dc105b5fd8e7e .............................................................................................................................................................................................................................................. 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/nested5-1.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 a1f0fc7e11527245c3cf532e554dc105b5fd8e7e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:09,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:23:09,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:23:09,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:23:09,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:23:09,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:23:09,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:23:09,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:23:09,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:23:09,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:23:09,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:23:09,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:23:09,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:23:09,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:23:09,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:23:09,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:23:09,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:23:09,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:23:09,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:23:09,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:23:09,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:23:09,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:23:09,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:23:09,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:23:09,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:23:09,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:23:09,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:23:09,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:23:09,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:23:09,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:23:09,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:23:09,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:23:09,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:23:09,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:23:09,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:23:09,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:23:09,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:23:09,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:23:09,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:23:09,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:23:09,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:23:09,881 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:09,910 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:23:09,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:23:09,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:23:09,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:23:09,913 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:23:09,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:23:09,914 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:23:09,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:23:09,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:23:09,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:23:09,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:23:09,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:23:09,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:23:09,917 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:23:09,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:23:09,918 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:23:09,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:23:09,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:23:09,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:23:09,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:23:09,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:23:09,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:23:09,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:23:09,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:23:09,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:23:09,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:23:09,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:23:09,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:23:09,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:23:09,922 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 -> a1f0fc7e11527245c3cf532e554dc105b5fd8e7e [2020-07-28 18:23:10,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:23:10,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:23:10,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:23:10,314 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:23:10,315 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:23:10,315 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested5-1.c [2020-07-28 18:23:10,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495b08621/4c63fe7804c04316a3df3af1d8fc0d1e/FLAGbdcc27ebc [2020-07-28 18:23:10,720 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:23:10,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested5-1.c [2020-07-28 18:23:10,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495b08621/4c63fe7804c04316a3df3af1d8fc0d1e/FLAGbdcc27ebc [2020-07-28 18:23:11,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495b08621/4c63fe7804c04316a3df3af1d8fc0d1e [2020-07-28 18:23:11,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:23:11,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:23:11,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:11,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:23:11,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:23:11,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:11" (1/1) ... [2020-07-28 18:23:11,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3264ec97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:11, skipping insertion in model container [2020-07-28 18:23:11,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:11" (1/1) ... [2020-07-28 18:23:11,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:23:11,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:23:11,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:11,353 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:23:11,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:11,389 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:23:11,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:11 WrapperNode [2020-07-28 18:23:11,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:11,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:11,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:23:11,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:23:11,400 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:11" (1/1) ... [2020-07-28 18:23:11,406 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:11" (1/1) ... [2020-07-28 18:23:11,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:11,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:23:11,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:23:11,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:23:11,550 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:11" (1/1) ... [2020-07-28 18:23:11,551 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:11" (1/1) ... [2020-07-28 18:23:11,559 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:11" (1/1) ... [2020-07-28 18:23:11,559 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:11" (1/1) ... [2020-07-28 18:23:11,567 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:11" (1/1) ... [2020-07-28 18:23:11,573 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:11" (1/1) ... [2020-07-28 18:23:11,575 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:11" (1/1) ... [2020-07-28 18:23:11,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:23:11,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:23:11,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:23:11,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:23:11,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:11" (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:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:23:11,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:23:11,955 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:23:11,956 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 18:23:11,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:11 BoogieIcfgContainer [2020-07-28 18:23:11,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:23:11,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:23:11,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:23:11,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:23:11,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:23:11" (1/3) ... [2020-07-28 18:23:11,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5035f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:11, skipping insertion in model container [2020-07-28 18:23:11,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:11" (2/3) ... [2020-07-28 18:23:11,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5035f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:11, skipping insertion in model container [2020-07-28 18:23:11,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:11" (3/3) ... [2020-07-28 18:23:11,972 INFO L109 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2020-07-28 18:23:11,988 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:23:11,996 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:23:12,012 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:23:12,039 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:23:12,039 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:23:12,040 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:23:12,040 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:23:12,040 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:23:12,040 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:23:12,040 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:23:12,041 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:23:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 18:23:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:23:12,067 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:23:12,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:23:12,068 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:23:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:23:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash -548469862, now seen corresponding path program 1 times [2020-07-28 18:23:12,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:23:12,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856166450] [2020-07-28 18:23:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:23:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:12,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:23:12,254 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:12,262 INFO L168 Benchmark]: Toolchain (without parser) took 1134.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:12,263 INFO L168 Benchmark]: CDTParser took 0.26 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:12,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 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:12,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:12,266 INFO L168 Benchmark]: Boogie Preprocessor took 38.15 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:12,267 INFO L168 Benchmark]: RCFGBuilder took 383.10 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:12,268 INFO L168 Benchmark]: TraceAbstraction took 296.19 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:12,272 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.26 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 262.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 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 148.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.15 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 383.10 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 296.19 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: 13.7 MB). Peak memory consumption was 13.7 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:14,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:23:14,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:23:14,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:23:14,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:23:14,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:23:14,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:23:14,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:23:14,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:23:14,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:23:14,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:23:14,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:23:14,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:23:14,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:23:14,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:23:14,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:23:14,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:23:14,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:23:14,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:23:14,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:23:14,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:23:14,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:23:14,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:23:14,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:23:14,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:23:14,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:23:14,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:23:14,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:23:14,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:23:14,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:23:14,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:23:14,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:23:14,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:23:14,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:23:14,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:23:14,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:23:14,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:23:14,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:23:14,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:23:14,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:23:14,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:23:14,327 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:14,342 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:23:14,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:23:14,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:23:14,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:23:14,344 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:23:14,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:23:14,345 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:23:14,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:23:14,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:23:14,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:23:14,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:23:14,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:23:14,346 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:23:14,347 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:23:14,347 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:23:14,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:23:14,347 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:23:14,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:23:14,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:23:14,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:23:14,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:23:14,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:23:14,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:23:14,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:23:14,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:23:14,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:23:14,350 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:23:14,351 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:23:14,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:23:14,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:23:14,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:23:14,352 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 -> a1f0fc7e11527245c3cf532e554dc105b5fd8e7e [2020-07-28 18:23:14,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:23:14,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:23:14,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:23:14,672 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:23:14,672 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:23:14,673 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested5-1.c [2020-07-28 18:23:14,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8849d9b/d43fe255bd39455ca44291db5c15b325/FLAGa8cc3825d [2020-07-28 18:23:15,222 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:23:15,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested5-1.c [2020-07-28 18:23:15,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8849d9b/d43fe255bd39455ca44291db5c15b325/FLAGa8cc3825d [2020-07-28 18:23:15,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8849d9b/d43fe255bd39455ca44291db5c15b325 [2020-07-28 18:23:15,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:23:15,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:23:15,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:15,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:23:15,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:23:15,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:15" (1/1) ... [2020-07-28 18:23:15,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f68bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:15, skipping insertion in model container [2020-07-28 18:23:15,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:23:15" (1/1) ... [2020-07-28 18:23:15,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:23:15,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:23:15,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:15,802 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:23:15,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:23:15,837 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:23:15,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:15 WrapperNode [2020-07-28 18:23:15,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:23:15,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:15,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:23:15,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:23:15,850 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:15" (1/1) ... [2020-07-28 18:23:15,858 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:15" (1/1) ... [2020-07-28 18:23:15,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:23:15,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:23:15,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:23:15,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:23:15,952 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:15" (1/1) ... [2020-07-28 18:23:15,953 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:15" (1/1) ... [2020-07-28 18:23:15,954 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:15" (1/1) ... [2020-07-28 18:23:15,955 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:15" (1/1) ... [2020-07-28 18:23:15,961 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:15" (1/1) ... [2020-07-28 18:23:15,967 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:15" (1/1) ... [2020-07-28 18:23:15,968 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:15" (1/1) ... [2020-07-28 18:23:15,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:23:15,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:23:15,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:23:15,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:23:15,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:15" (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:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:23:16,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:23:16,423 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:23:16,423 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 18:23:16,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:16 BoogieIcfgContainer [2020-07-28 18:23:16,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:23:16,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:23:16,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:23:16,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:23:16,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:23:15" (1/3) ... [2020-07-28 18:23:16,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a11660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:16, skipping insertion in model container [2020-07-28 18:23:16,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:23:15" (2/3) ... [2020-07-28 18:23:16,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a11660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:23:16, skipping insertion in model container [2020-07-28 18:23:16,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:23:16" (3/3) ... [2020-07-28 18:23:16,439 INFO L109 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2020-07-28 18:23:16,448 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:23:16,454 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:23:16,467 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:23:16,491 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:23:16,491 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:23:16,492 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:23:16,492 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:23:16,492 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:23:16,492 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:23:16,492 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:23:16,492 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:23:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 18:23:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:23:16,512 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:23:16,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:23:16,513 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:23:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:23:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash -548469862, now seen corresponding path program 1 times [2020-07-28 18:23:16,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:23:16,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462257967] [2020-07-28 18:23:16,533 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:23:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:16,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:23:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:16,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:23:16,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {22#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,680 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {39#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:16,681 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} assume !~bvult32(main_~v~0, 10bv32); {23#false} is VALID [2020-07-28 18:23:16,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 18:23:16,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0bv32 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 18:23:16,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 18:23:16,685 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:16,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:23:16,709 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 18:23:16,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0bv32 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 18:23:16,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 18:23:16,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {61#(bvult ULTIMATE.start_main_~v~0 (_ bv10 32))} assume !~bvult32(main_~v~0, 10bv32); {23#false} is VALID [2020-07-28 18:23:16,712 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {61#(bvult ULTIMATE.start_main_~v~0 (_ bv10 32))} is VALID [2020-07-28 18:23:16,712 INFO L280 TraceCheckUtils]: 3: Hoare triple {22#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {22#true} is VALID [2020-07-28 18:23:16,714 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:16,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462257967] [2020-07-28 18:23:16,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:23:16,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-07-28 18:23:16,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255556852] [2020-07-28 18:23:16,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 18:23:16,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:23:16,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:23:16,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:16,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:23:16,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:23:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:23:16,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:23:16,772 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 4 states. [2020-07-28 18:23:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:16,978 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2020-07-28 18:23:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:23:16,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 18:23:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:23:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:23:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-28 18:23:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:23:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-28 18:23:16,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2020-07-28 18:23:17,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:17,137 INFO L225 Difference]: With dead ends: 51 [2020-07-28 18:23:17,138 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 18:23:17,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:23:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 18:23:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2020-07-28 18:23:17,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:23:17,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 18 states. [2020-07-28 18:23:17,190 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 18 states. [2020-07-28 18:23:17,190 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 18 states. [2020-07-28 18:23:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:17,194 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-28 18:23:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-07-28 18:23:17,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:17,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:17,195 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 25 states. [2020-07-28 18:23:17,196 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 25 states. [2020-07-28 18:23:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:17,199 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-28 18:23:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-07-28 18:23:17,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:17,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:17,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:23:17,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:23:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 18:23:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-07-28 18:23:17,205 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2020-07-28 18:23:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:23:17,206 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-07-28 18:23:17,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:23:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-07-28 18:23:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 18:23:17,207 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:23:17,207 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:23:17,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:23:17,421 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:23:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:23:17,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1091497122, now seen corresponding path program 1 times [2020-07-28 18:23:17,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:23:17,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103810375] [2020-07-28 18:23:17,424 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:23:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:17,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:23:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:17,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:23:17,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {224#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {241#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:17,535 INFO L280 TraceCheckUtils]: 5: Hoare triple {241#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {241#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:17,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {241#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {248#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:17,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {248#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {248#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:17,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {255#(= (_ bv2 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:17,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {255#(= (_ bv2 32) ULTIMATE.start_main_~v~0)} assume !~bvult32(main_~v~0, 10bv32); {225#false} is VALID [2020-07-28 18:23:17,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {225#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {225#false} is VALID [2020-07-28 18:23:17,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {225#false} assume 0bv32 == __VERIFIER_assert_~cond; {225#false} is VALID [2020-07-28 18:23:17,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-28 18:23:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:23:17,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:23:17,653 INFO L280 TraceCheckUtils]: 12: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-28 18:23:17,654 INFO L280 TraceCheckUtils]: 11: Hoare triple {225#false} assume 0bv32 == __VERIFIER_assert_~cond; {225#false} is VALID [2020-07-28 18:23:17,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {225#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {225#false} is VALID [2020-07-28 18:23:17,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {277#(bvult ULTIMATE.start_main_~v~0 (_ bv10 32))} assume !~bvult32(main_~v~0, 10bv32); {225#false} is VALID [2020-07-28 18:23:17,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {281#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv10 32))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {277#(bvult ULTIMATE.start_main_~v~0 (_ bv10 32))} is VALID [2020-07-28 18:23:17,658 INFO L280 TraceCheckUtils]: 7: Hoare triple {281#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvult32(main_~v~0, 10bv32); {281#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-28 18:23:17,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {288#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv10 32))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {281#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-28 18:23:17,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {288#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvult32(main_~v~0, 10bv32); {288#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv10 32))} is VALID [2020-07-28 18:23:17,665 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {288#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv10 32))} is VALID [2020-07-28 18:23:17,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {224#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {224#true} is VALID [2020-07-28 18:23:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:23:17,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103810375] [2020-07-28 18:23:17,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:23:17,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-28 18:23:17,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320201084] [2020-07-28 18:23:17,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-28 18:23:17,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:23:17,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:23:17,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:17,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:23:17,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:23:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:23:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:23:17,714 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 8 states. [2020-07-28 18:23:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:18,116 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-28 18:23:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:23:18,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-28 18:23:18,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:23:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:23:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-28 18:23:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:23:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-28 18:23:18,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2020-07-28 18:23:18,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:18,232 INFO L225 Difference]: With dead ends: 50 [2020-07-28 18:23:18,232 INFO L226 Difference]: Without dead ends: 33 [2020-07-28 18:23:18,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:23:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-28 18:23:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-28 18:23:18,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:23:18,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 26 states. [2020-07-28 18:23:18,247 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 26 states. [2020-07-28 18:23:18,247 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 26 states. [2020-07-28 18:23:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:18,250 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-28 18:23:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-07-28 18:23:18,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:18,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:18,252 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 33 states. [2020-07-28 18:23:18,252 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 33 states. [2020-07-28 18:23:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:18,255 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-28 18:23:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-07-28 18:23:18,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:18,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:18,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:23:18,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:23:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 18:23:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2020-07-28 18:23:18,259 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2020-07-28 18:23:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:23:18,260 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-07-28 18:23:18,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:23:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-28 18:23:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 18:23:18,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:23:18,261 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:23:18,473 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:23:18,474 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:23:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:23:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2142917402, now seen corresponding path program 2 times [2020-07-28 18:23:18,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:23:18,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878493030] [2020-07-28 18:23:18,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:23:18,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:23:18,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:23:18,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 18:23:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:18,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:23:18,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {488#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {488#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,682 INFO L280 TraceCheckUtils]: 4: Hoare triple {488#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {505#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {505#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {505#(= (_ bv0 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {512#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,685 INFO L280 TraceCheckUtils]: 7: Hoare triple {512#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {512#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#(= (_ bv1 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {519#(= (_ bv2 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {519#(= (_ bv2 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {519#(= (_ bv2 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,692 INFO L280 TraceCheckUtils]: 10: Hoare triple {519#(= (_ bv2 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {526#(= (_ bv3 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {526#(= (_ bv3 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {526#(= (_ bv3 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,695 INFO L280 TraceCheckUtils]: 12: Hoare triple {526#(= (_ bv3 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {533#(= (_ bv4 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {533#(= (_ bv4 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {533#(= (_ bv4 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {533#(= (_ bv4 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {540#(= (_ bv5 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,702 INFO L280 TraceCheckUtils]: 15: Hoare triple {540#(= (_ bv5 32) ULTIMATE.start_main_~v~0)} assume !!~bvult32(main_~v~0, 10bv32); {540#(= (_ bv5 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {540#(= (_ bv5 32) ULTIMATE.start_main_~v~0)} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {547#(= (_ bv6 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,707 INFO L280 TraceCheckUtils]: 17: Hoare triple {547#(= (_ bv6 32) ULTIMATE.start_main_~v~0)} assume !~bvult32(main_~v~0, 10bv32); {547#(= (_ bv6 32) ULTIMATE.start_main_~v~0)} is VALID [2020-07-28 18:23:18,710 INFO L280 TraceCheckUtils]: 18: Hoare triple {547#(= (_ bv6 32) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {554#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967294 32)) (_ bv0 32))} is VALID [2020-07-28 18:23:18,712 INFO L280 TraceCheckUtils]: 19: Hoare triple {554#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {489#false} is VALID [2020-07-28 18:23:18,712 INFO L280 TraceCheckUtils]: 20: Hoare triple {489#false} assume !false; {489#false} is VALID [2020-07-28 18:23:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:23:18,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:23:18,901 INFO L280 TraceCheckUtils]: 20: Hoare triple {489#false} assume !false; {489#false} is VALID [2020-07-28 18:23:18,902 INFO L280 TraceCheckUtils]: 19: Hoare triple {564#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {489#false} is VALID [2020-07-28 18:23:18,903 INFO L280 TraceCheckUtils]: 18: Hoare triple {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {564#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:23:18,904 INFO L280 TraceCheckUtils]: 17: Hoare triple {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} assume !~bvult32(main_~v~0, 10bv32); {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} is VALID [2020-07-28 18:23:18,905 INFO L280 TraceCheckUtils]: 16: Hoare triple {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} is VALID [2020-07-28 18:23:18,906 INFO L280 TraceCheckUtils]: 15: Hoare triple {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} assume !!~bvult32(main_~v~0, 10bv32); {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} is VALID [2020-07-28 18:23:18,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} is VALID [2020-07-28 18:23:18,909 INFO L280 TraceCheckUtils]: 13: Hoare triple {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} assume !!~bvult32(main_~v~0, 10bv32); {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:23:18,910 INFO L280 TraceCheckUtils]: 12: Hoare triple {589#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32)))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:23:18,911 INFO L280 TraceCheckUtils]: 11: Hoare triple {589#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32)))} assume !!~bvult32(main_~v~0, 10bv32); {589#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:23:18,913 INFO L280 TraceCheckUtils]: 10: Hoare triple {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {589#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:23:18,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} assume !!~bvult32(main_~v~0, 10bv32); {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} is VALID [2020-07-28 18:23:18,916 INFO L280 TraceCheckUtils]: 8: Hoare triple {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {568#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} is VALID [2020-07-28 18:23:18,917 INFO L280 TraceCheckUtils]: 7: Hoare triple {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} assume !!~bvult32(main_~v~0, 10bv32); {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} is VALID [2020-07-28 18:23:18,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {575#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32))))} is VALID [2020-07-28 18:23:18,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} assume !!~bvult32(main_~v~0, 10bv32); {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:23:18,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {488#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {582#(not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2020-07-28 18:23:18,921 INFO L280 TraceCheckUtils]: 3: Hoare triple {488#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {488#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {488#true} is VALID [2020-07-28 18:23:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 18:23:18,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878493030] [2020-07-28 18:23:18,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:23:18,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2020-07-28 18:23:18,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438375642] [2020-07-28 18:23:18,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-07-28 18:23:18,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:23:18,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-28 18:23:18,986 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:23:18,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-28 18:23:18,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:23:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-28 18:23:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-07-28 18:23:18,988 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 15 states. [2020-07-28 18:23:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:22,138 INFO L93 Difference]: Finished difference Result 149 states and 186 transitions. [2020-07-28 18:23:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-07-28 18:23:22,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-07-28 18:23:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:23:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 18:23:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 175 transitions. [2020-07-28 18:23:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 18:23:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 175 transitions. [2020-07-28 18:23:22,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 175 transitions. [2020-07-28 18:23:22,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:22,505 INFO L225 Difference]: With dead ends: 149 [2020-07-28 18:23:22,505 INFO L226 Difference]: Without dead ends: 124 [2020-07-28 18:23:22,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2020-07-28 18:23:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-07-28 18:23:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 36. [2020-07-28 18:23:22,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:23:22,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 36 states. [2020-07-28 18:23:22,573 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 36 states. [2020-07-28 18:23:22,573 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 36 states. [2020-07-28 18:23:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:22,581 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2020-07-28 18:23:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2020-07-28 18:23:22,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:22,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:22,587 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 124 states. [2020-07-28 18:23:22,587 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 124 states. [2020-07-28 18:23:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:22,595 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2020-07-28 18:23:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2020-07-28 18:23:22,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:22,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:22,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:23:22,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:23:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-28 18:23:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-28 18:23:22,602 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 21 [2020-07-28 18:23:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:23:22,603 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-28 18:23:22,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-28 18:23:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-28 18:23:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-28 18:23:22,605 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:23:22,605 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:23:22,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:23:22,818 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:23:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:23:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1184511658, now seen corresponding path program 3 times [2020-07-28 18:23:22,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:23:22,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298491643] [2020-07-28 18:23:22,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:23:22,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 18:23:22,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:23:22,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:23:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:23:22,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:23:22,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {1199#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:22,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {1199#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:22,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {1199#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:22,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {1199#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:22,980 INFO L280 TraceCheckUtils]: 4: Hoare triple {1199#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:22,980 INFO L280 TraceCheckUtils]: 5: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:22,980 INFO L280 TraceCheckUtils]: 6: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:22,981 INFO L280 TraceCheckUtils]: 7: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:22,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:22,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:22,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:22,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:22,982 INFO L280 TraceCheckUtils]: 12: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:22,983 INFO L280 TraceCheckUtils]: 13: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:22,983 INFO L280 TraceCheckUtils]: 14: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:22,983 INFO L280 TraceCheckUtils]: 15: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:22,983 INFO L280 TraceCheckUtils]: 16: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:22,984 INFO L280 TraceCheckUtils]: 17: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:22,984 INFO L280 TraceCheckUtils]: 18: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:22,985 INFO L280 TraceCheckUtils]: 19: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1261#(bvult ULTIMATE.start_main_~v~0 (_ bv10 32))} is VALID [2020-07-28 18:23:22,988 INFO L280 TraceCheckUtils]: 20: Hoare triple {1261#(bvult ULTIMATE.start_main_~v~0 (_ bv10 32))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1265#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32))} is VALID [2020-07-28 18:23:22,994 INFO L280 TraceCheckUtils]: 21: Hoare triple {1265#(bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32))} assume !~bvult32(main_~v~0, 10bv32); {1269#(and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) (not (bvult ULTIMATE.start_main_~v~0 (_ bv10 32))))} is VALID [2020-07-28 18:23:22,997 INFO L280 TraceCheckUtils]: 22: Hoare triple {1269#(and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) (not (bvult ULTIMATE.start_main_~v~0 (_ bv10 32))))} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1273#(exists ((ULTIMATE.start_main_~v~0 (_ BitVec 32))) (and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) (= ULTIMATE.start___VERIFIER_assert_~cond (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))) (not (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)))))} is VALID [2020-07-28 18:23:23,000 INFO L280 TraceCheckUtils]: 23: Hoare triple {1273#(exists ((ULTIMATE.start_main_~v~0 (_ BitVec 32))) (and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) (= ULTIMATE.start___VERIFIER_assert_~cond (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))) (not (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)))))} assume 0bv32 == __VERIFIER_assert_~cond; {1200#false} is VALID [2020-07-28 18:23:23,000 INFO L280 TraceCheckUtils]: 24: Hoare triple {1200#false} assume !false; {1200#false} is VALID [2020-07-28 18:23:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-07-28 18:23:23,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:23:23,174 INFO L280 TraceCheckUtils]: 24: Hoare triple {1200#false} assume !false; {1200#false} is VALID [2020-07-28 18:23:23,174 INFO L280 TraceCheckUtils]: 23: Hoare triple {1283#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1200#false} is VALID [2020-07-28 18:23:23,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {1287#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} __VERIFIER_assert_#in~cond := ~bvurem32(main_~v~0, 4bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1283#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:23:23,176 INFO L280 TraceCheckUtils]: 21: Hoare triple {1291#(or (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)) (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32)))))} assume !~bvult32(main_~v~0, 10bv32); {1287#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32))))} is VALID [2020-07-28 18:23:23,178 INFO L280 TraceCheckUtils]: 20: Hoare triple {1295#(or (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32)))) (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv10 32)))} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1291#(or (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)) (not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~v~0 (_ bv4 32)))))} is VALID [2020-07-28 18:23:23,180 INFO L280 TraceCheckUtils]: 19: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1295#(or (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv4 32)))) (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv1 32)) (_ bv10 32)))} is VALID [2020-07-28 18:23:23,181 INFO L280 TraceCheckUtils]: 18: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:23,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:23,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:23,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:23,182 INFO L280 TraceCheckUtils]: 14: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:23,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:23,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:23,183 INFO L280 TraceCheckUtils]: 11: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:23,183 INFO L280 TraceCheckUtils]: 10: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:23,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:23,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:23,184 INFO L280 TraceCheckUtils]: 7: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:23,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {1199#true} main_#t~post4 := main_~v~0;main_~v~0 := ~bvadd32(1bv32, main_#t~post4);havoc main_#t~post4; {1199#true} is VALID [2020-07-28 18:23:23,190 INFO L280 TraceCheckUtils]: 5: Hoare triple {1199#true} assume !!~bvult32(main_~v~0, 10bv32); {1199#true} is VALID [2020-07-28 18:23:23,191 INFO L280 TraceCheckUtils]: 4: Hoare triple {1199#true} assume !!~bvult32(main_~z~0, 10bv32);main_~v~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:23,191 INFO L280 TraceCheckUtils]: 3: Hoare triple {1199#true} assume !!~bvult32(main_~y~0, 10bv32);main_~z~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:23,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {1199#true} assume !!~bvult32(main_~x~0, 10bv32);main_~y~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:23,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {1199#true} assume !!~bvult32(main_~w~0, 268435455bv32);main_~x~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:23,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {1199#true} havoc main_#res;havoc main_#t~post4, main_#t~post3, main_#t~post2, main_#t~post1, main_#t~post0, main_~x~0, main_~y~0, main_~z~0, main_~w~0, main_~v~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32;main_~z~0 := 0bv32;main_~w~0 := 0bv32;main_~v~0 := 0bv32;main_~w~0 := 0bv32; {1199#true} is VALID [2020-07-28 18:23:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-07-28 18:23:23,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298491643] [2020-07-28 18:23:23,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:23:23,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-07-28 18:23:23,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543824107] [2020-07-28 18:23:23,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-07-28 18:23:23,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:23:23,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 18:23:23,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:23,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 18:23:23,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:23:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 18:23:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:23:23,246 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2020-07-28 18:23:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:24,205 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-28 18:23:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 18:23:24,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-07-28 18:23:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:23:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:23:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2020-07-28 18:23:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:23:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2020-07-28 18:23:24,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2020-07-28 18:23:24,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:23:24,340 INFO L225 Difference]: With dead ends: 66 [2020-07-28 18:23:24,340 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:23:24,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-07-28 18:23:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:23:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:23:24,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:23:24,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:23:24,342 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:23:24,343 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:23:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:24,343 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:23:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:23:24,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:24,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:24,343 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:23:24,343 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:23:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:23:24,344 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:23:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:23:24,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:24,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:23:24,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:23:24,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:23:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:23:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:23:24,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-28 18:23:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:23:24,345 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:23:24,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 18:23:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:23:24,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:23:24,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:23:24,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:23:24,963 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-07-28 18:23:25,090 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-07-28 18:23:25,220 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-07-28 18:23:25,390 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 8 [2020-07-28 18:23:25,574 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-07-28 18:23:25,580 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 23) no Hoare annotation was computed. [2020-07-28 18:23:25,581 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 23) the Hoare annotation is: (let ((.cse0 (or (and (not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32))) (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (= (_ bv0 32) ULTIMATE.start_main_~v~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967294 32)) (_ bv0 32))))) (or (and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) .cse0) (and (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)) .cse0))) [2020-07-28 18:23:25,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:23:25,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:23:25,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:23:25,581 INFO L271 CegarLoopResult]: At program point L24(lines 10 25) the Hoare annotation is: true [2020-07-28 18:23:25,582 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 23) the Hoare annotation is: (let ((.cse0 (or (and (not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32))) (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (= (_ bv0 32) ULTIMATE.start_main_~v~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967294 32)) (_ bv0 32))))) (or (and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) .cse0) (and (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)) .cse0))) [2020-07-28 18:23:25,582 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:23:25,582 INFO L264 CegarLoopResult]: At program point L4-2(lines 1 25) the Hoare annotation is: (and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) (not (bvult ULTIMATE.start_main_~v~0 (_ bv10 32))) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967294 32)) (_ bv0 32))) [2020-07-28 18:23:25,582 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:23:25,583 INFO L268 CegarLoopResult]: For program point L21-2(line 21) no Hoare annotation was computed. [2020-07-28 18:23:25,583 INFO L264 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (or (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) (= (_ bv0 32) ULTIMATE.start_main_~v~0)) [2020-07-28 18:23:25,583 INFO L268 CegarLoopResult]: For program point L21-4(line 21) no Hoare annotation was computed. [2020-07-28 18:23:25,583 INFO L268 CegarLoopResult]: For program point L17-2(lines 17 23) no Hoare annotation was computed. [2020-07-28 18:23:25,583 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 23) the Hoare annotation is: (let ((.cse0 (or (and (not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32))) (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (= (_ bv0 32) ULTIMATE.start_main_~v~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967294 32)) (_ bv0 32))))) (or (and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) .cse0) (and (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)) .cse0))) [2020-07-28 18:23:25,583 INFO L268 CegarLoopResult]: For program point L17-4(lines 17 23) no Hoare annotation was computed. [2020-07-28 18:23:25,583 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:23:25,583 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 23) no Hoare annotation was computed. [2020-07-28 18:23:25,583 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 23) the Hoare annotation is: (let ((.cse0 (or (and (not (= (bvurem (bvadd ULTIMATE.start_main_~v~0 (_ bv2 32)) (_ bv4 32)) (_ bv0 32))) (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (= (_ bv0 32) ULTIMATE.start_main_~v~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967294 32)) (_ bv0 32))))) (or (and (bvult (bvadd ULTIMATE.start_main_~v~0 (_ bv4294967295 32)) (_ bv10 32)) .cse0) (and (bvult ULTIMATE.start_main_~v~0 (_ bv10 32)) .cse0))) [2020-07-28 18:23:25,587 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:23:25,587 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-28 18:23:25,587 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-28 18:23:25,588 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-28 18:23:25,588 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-28 18:23:25,588 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-28 18:23:25,589 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:23:25,589 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-28 18:23:25,589 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 18:23:25,589 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 18:23:25,589 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:23:25,589 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 18:23:25,589 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 18:23:25,590 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 18:23:25,590 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 18:23:25,590 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 18:23:25,590 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 18:23:25,590 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-28 18:23:25,591 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 18:23:25,591 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-28 18:23:25,591 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:23:25,591 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:23:25,591 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:23:25,591 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:23:25,593 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:23:25,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:23:25 BoogieIcfgContainer [2020-07-28 18:23:25,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:23:25,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:23:25,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:23:25,619 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:23:25,619 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:16" (3/4) ... [2020-07-28 18:23:25,629 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:23:25,641 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:23:25,641 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:23:25,688 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:23:25,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:23:25,690 INFO L168 Benchmark]: Toolchain (without parser) took 10098.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.1 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:25,691 INFO L168 Benchmark]: CDTParser took 0.26 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:25,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.42 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:25,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:25,693 INFO L168 Benchmark]: Boogie Preprocessor took 29.13 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:25,693 INFO L168 Benchmark]: RCFGBuilder took 456.35 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:25,694 INFO L168 Benchmark]: TraceAbstraction took 9189.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.9 MB). Peak memory consumption was 91.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:25,694 INFO L168 Benchmark]: Witness Printer took 69.69 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:23:25,698 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.26 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 244.42 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 102.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.13 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 456.35 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9189.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.9 MB). Peak memory consumption was 91.4 MB. Max. memory is 11.5 GB. * Witness Printer took 69.69 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 18]: Loop Invariant Derived loop invariant: (~bvult32(~bvadd64(v, 4294967295bv32), 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) || (~bvult32(v, 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (~bvult32(~bvadd64(v, 4294967295bv32), 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) || (~bvult32(v, 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (~bvult32(~bvadd64(v, 4294967295bv32), 10bv32) && !~bvult32(v, 10bv32)) && ~bvadd64(cond, 4294967294bv32) == 0bv32 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ~bvult32(~bvadd64(v, 4294967295bv32), 10bv32) || 0bv32 == v - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (~bvult32(~bvadd64(v, 4294967295bv32), 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) || (~bvult32(v, 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (~bvult32(~bvadd64(v, 4294967295bv32), 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) || (~bvult32(v, 10bv32) && (((!(~bvurem32(~bvadd64(v, 2bv32), 4bv32) == 0bv32) && !(cond == 0bv32)) || 0bv32 == v) || ~bvadd64(cond, 4294967294bv32) == 0bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.0s, OverallIterations: 4, TraceHistogramMax: 8, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 118 SDtfs, 379 SDslu, 502 SDs, 0 SdLazy, 639 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=3, 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, 4 MinimizatonAttempts, 102 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 40 NumberOfFragments, 245 HoareAnnotationTreeSize, 7 FomulaSimplifications, 918 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1403 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 68 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 128 ConstructedInterpolants, 1 QuantifiedInterpolants, 6676 SizeOfPredicates, 9 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 133/208 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...