./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.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 d80676b9a99131191df12fd74204f331d0509f64 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:20:23,694 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:20:23,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:20:23,711 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:20:23,711 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:20:23,712 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:20:23,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:20:23,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:20:23,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:20:23,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:20:23,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:20:23,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:20:23,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:20:23,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:20:23,723 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:20:23,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:20:23,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:20:23,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:20:23,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:20:23,730 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:20:23,731 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:20:23,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:20:23,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:20:23,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:20:23,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:20:23,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:20:23,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:20:23,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:20:23,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:20:23,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:20:23,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:20:23,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:20:23,742 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:20:23,742 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:20:23,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:20:23,744 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:20:23,745 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:20:23,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:20:23,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:20:23,776 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:20:23,777 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:20:23,777 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:20:23,777 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:20:23,778 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:20:23,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:20:23,780 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:20:23,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:20:23,780 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:20:23,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:20:23,780 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:20:23,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:20:23,781 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:20:23,782 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:20:23,782 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:20:23,782 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:20:23,782 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:20:23,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:20:23,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:20:23,787 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:20:23,787 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:20:23,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:20:23,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:20:23,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:20:23,788 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:20:23,788 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:20:23,788 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:20:23,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:20:23,788 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> d80676b9a99131191df12fd74204f331d0509f64 [2018-11-28 18:20:23,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:20:23,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:20:23,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:20:23,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:20:23,841 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:20:23,842 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-28 18:20:23,900 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1170d3a/1c540581fa5246cfadc78ec0fc32030d/FLAG7978d03ba [2018-11-28 18:20:24,362 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:20:24,362 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-28 18:20:24,378 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1170d3a/1c540581fa5246cfadc78ec0fc32030d/FLAG7978d03ba [2018-11-28 18:20:24,719 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1170d3a/1c540581fa5246cfadc78ec0fc32030d [2018-11-28 18:20:24,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:20:24,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:20:24,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:24,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:20:24,735 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:20:24,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:24" (1/1) ... [2018-11-28 18:20:24,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef72e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:24, skipping insertion in model container [2018-11-28 18:20:24,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:24" (1/1) ... [2018-11-28 18:20:24,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:20:24,777 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:20:25,002 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:25,013 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:20:25,058 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:25,083 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:20:25,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25 WrapperNode [2018-11-28 18:20:25,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:25,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:25,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:20:25,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:20:25,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:25,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:20:25,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:20:25,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:20:25,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (1/1) ... [2018-11-28 18:20:25,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:20:25,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:20:25,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:20:25,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:20:25,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (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 [2018-11-28 18:20:25,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:20:25,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:20:25,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:20:25,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:20:25,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:20:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:20:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:20:25,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:20:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:20:25,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:20:25,780 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:20:25,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:25 BoogieIcfgContainer [2018-11-28 18:20:25,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:20:25,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:20:25,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:20:25,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:20:25,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:20:24" (1/3) ... [2018-11-28 18:20:25,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023390a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:25, skipping insertion in model container [2018-11-28 18:20:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:25" (2/3) ... [2018-11-28 18:20:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023390a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:25, skipping insertion in model container [2018-11-28 18:20:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:25" (3/3) ... [2018-11-28 18:20:25,788 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-28 18:20:25,798 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:20:25,806 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-28 18:20:25,824 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-28 18:20:25,857 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:20:25,858 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:20:25,858 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:20:25,858 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:20:25,858 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:20:25,858 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:20:25,859 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:20:25,859 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:20:25,859 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:20:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-28 18:20:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:20:25,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:25,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:25,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:25,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2018-11-28 18:20:25,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:25,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:25,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:25,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:26,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:26,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:20:26,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:20:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:20:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:26,104 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-28 18:20:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:26,151 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-11-28 18:20:26,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:20:26,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 18:20:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:26,162 INFO L225 Difference]: With dead ends: 56 [2018-11-28 18:20:26,162 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 18:20:26,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 18:20:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 18:20:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 18:20:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-28 18:20:26,206 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2018-11-28 18:20:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:26,207 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 18:20:26,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:20:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-28 18:20:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:20:26,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:26,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:26,208 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:26,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2018-11-28 18:20:26,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:26,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:26,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:26,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:20:26,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:20:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:20:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:20:26,310 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-11-28 18:20:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:26,446 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-28 18:20:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:20:26,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-28 18:20:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:26,449 INFO L225 Difference]: With dead ends: 53 [2018-11-28 18:20:26,449 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 18:20:26,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:20:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 18:20:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-11-28 18:20:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:20:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-28 18:20:26,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2018-11-28 18:20:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:26,465 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-28 18:20:26,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:20:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-28 18:20:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:20:26,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:26,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:26,467 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:26,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2018-11-28 18:20:26,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:26,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:26,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:26,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:26,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:26,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:20:26,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:20:26,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:20:26,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:26,555 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-11-28 18:20:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:26,641 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-28 18:20:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:20:26,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-28 18:20:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:26,643 INFO L225 Difference]: With dead ends: 62 [2018-11-28 18:20:26,643 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 18:20:26,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 18:20:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-11-28 18:20:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:20:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:20:26,650 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-11-28 18:20:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:26,651 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:20:26,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:20:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:20:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:20:26,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:26,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:26,653 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:26,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:26,653 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2018-11-28 18:20:26,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:26,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:26,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:26,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:20:26,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:20:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:20:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:26,700 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-11-28 18:20:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:26,855 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-28 18:20:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:20:26,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 18:20:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:26,857 INFO L225 Difference]: With dead ends: 56 [2018-11-28 18:20:26,857 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 18:20:26,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 18:20:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-28 18:20:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 18:20:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 18:20:26,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-11-28 18:20:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:26,864 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 18:20:26,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:20:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 18:20:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:20:26,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:26,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:26,865 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:26,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:26,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2018-11-28 18:20:26,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:26,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:26,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:27,515 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 11 [2018-11-28 18:20:28,275 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 19 [2018-11-28 18:20:28,519 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 22 [2018-11-28 18:20:29,190 WARN L180 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 21 [2018-11-28 18:20:29,776 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 36 [2018-11-28 18:20:30,226 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 41 [2018-11-28 18:20:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:30,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:30,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 18:20:30,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:20:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:20:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:30,341 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2018-11-28 18:20:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:30,938 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-28 18:20:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 18:20:30,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-28 18:20:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:30,943 INFO L225 Difference]: With dead ends: 49 [2018-11-28 18:20:30,943 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 18:20:30,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:20:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 18:20:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-28 18:20:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:20:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-28 18:20:30,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2018-11-28 18:20:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:30,950 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-28 18:20:30,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:20:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-28 18:20:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 18:20:30,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:30,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:30,951 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:30,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2018-11-28 18:20:30,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:30,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:30,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:31,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:31,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:20:31,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:20:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:20:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:20:31,068 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-11-28 18:20:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:31,139 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-28 18:20:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:31,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 18:20:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:31,140 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:20:31,141 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 18:20:31,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:20:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 18:20:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2018-11-28 18:20:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 18:20:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-28 18:20:31,147 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-11-28 18:20:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:31,147 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-28 18:20:31,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:20:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-28 18:20:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 18:20:31,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:31,149 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:31,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:31,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2018-11-28 18:20:31,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:31,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:31,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:31,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:31,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:31,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:31,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:31,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:20:31,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-28 18:20:31,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:20:31,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:20:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:20:31,509 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-11-28 18:20:33,936 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-28 18:20:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:40,250 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-28 18:20:40,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:20:40,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-28 18:20:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:40,251 INFO L225 Difference]: With dead ends: 43 [2018-11-28 18:20:40,251 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 18:20:40,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:20:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 18:20:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-28 18:20:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 18:20:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-28 18:20:40,259 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-11-28 18:20:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:40,260 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-28 18:20:40,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:20:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-28 18:20:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:20:40,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:40,261 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:40,261 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:40,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:40,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1779426667, now seen corresponding path program 1 times [2018-11-28 18:20:40,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:40,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:40,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:40,672 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-28 18:20:40,891 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-28 18:20:43,062 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-28 18:20:45,003 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-11-28 18:20:47,942 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 18:20:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:51,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:51,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:51,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:51,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:51,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:20:51,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 11 [2018-11-28 18:20:51,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:20:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:20:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=76, Unknown=1, NotChecked=0, Total=110 [2018-11-28 18:20:51,657 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 11 states. [2018-11-28 18:20:57,092 WARN L180 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-28 18:21:00,835 WARN L180 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 17 [2018-11-28 18:21:05,258 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 18:21:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:11,564 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-28 18:21:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:21:11,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-28 18:21:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:11,573 INFO L225 Difference]: With dead ends: 39 [2018-11-28 18:21:11,573 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:21:11,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=72, Invalid=136, Unknown=2, NotChecked=0, Total=210 [2018-11-28 18:21:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:21:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:21:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:21:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:21:11,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-28 18:21:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:11,577 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:21:11,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:21:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:21:11,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:21:11,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:21:11,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:12,088 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2018-11-28 18:21:21,452 WARN L180 SmtUtils]: Spent 9.36 s on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2018-11-28 18:21:21,655 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2018-11-28 18:21:21,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:21:21,659 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:21:21,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:21,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:21,659 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:21:21,659 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:21:21,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:21:21,659 INFO L451 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2018-11-28 18:21:21,660 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2018-11-28 18:21:21,660 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2018-11-28 18:21:21,660 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2018-11-28 18:21:21,660 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-11-28 18:21:21,660 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2018-11-28 18:21:21,660 INFO L444 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse10 (div main_~main__index1~0 4294967296)) (.cse9 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse1 (* 4294967296 .cse9)) (.cse3 (+ (* 4294967296 .cse10) main_~main__index2~0)) (.cse2 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) (<= main_~main__index2~0 (+ .cse1 99999)) .cse2 (<= (+ main_~main__index1~0 .cse1 1) .cse3)) (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998)) .cse0 (or (let ((.cse8 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse8 (+ (* (- 17179869184) .cse10) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse7 (select .cse8 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse9))))) (let ((.cse6 (* 4294967296 (div .cse7 4294967296))) (.cse4 (+ (* 4294967296 (div .cse5 4294967296)) .cse7))) (and (<= .cse4 (+ .cse5 .cse6)) (<= (+ .cse6 .cse5) .cse4))))) (<= (+ main_~main__index1~0 .cse1) .cse3)) .cse2)))) [2018-11-28 18:21:21,661 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2018-11-28 18:21:21,661 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2018-11-28 18:21:21,661 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-11-28 18:21:21,661 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-11-28 18:21:21,661 INFO L444 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~main__index1~0 4294967296))) (.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= |main_~#main__array~0.offset| 0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 .cse0 1) (+ .cse1 main_~main__index2~0)) (<= (+ .cse1 (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296)) 1) (+ main_~main__index1~0 .cse0)))) [2018-11-28 18:21:21,661 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2018-11-28 18:21:21,661 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-11-28 18:21:21,662 INFO L444 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse1 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse2 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 .cse1 .cse2 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= 0 main_~__VERIFIER_assert__cond~1))) (and .cse0 (= main_~main____CPAchecker_TMP_0~0 1) .cse1 .cse2))) (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-28 18:21:21,662 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-28 18:21:21,662 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-11-28 18:21:21,662 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-11-28 18:21:21,662 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-28 18:21:21,662 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2018-11-28 18:21:21,662 INFO L444 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-11-28 18:21:21,662 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2018-11-28 18:21:21,663 INFO L444 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= |main_~#main__array~0.offset| 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-28 18:21:21,663 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2018-11-28 18:21:21,663 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-11-28 18:21:21,663 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-28 18:21:21,663 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2018-11-28 18:21:21,663 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2018-11-28 18:21:21,663 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-11-28 18:21:21,663 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-11-28 18:21:21,664 INFO L444 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-11-28 18:21:21,664 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-28 18:21:21,664 INFO L444 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998)) (= |main_~#main__array~0.offset| 0) (not (= 0 main_~__VERIFIER_assert__cond~2)) (= main_~__VERIFIER_assert__cond~0 1)) [2018-11-28 18:21:21,664 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-28 18:21:21,664 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-11-28 18:21:21,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:21 BoogieIcfgContainer [2018-11-28 18:21:21,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:21:21,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:21:21,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:21:21,697 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:21:21,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:25" (3/4) ... [2018-11-28 18:21:21,701 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:21:21,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:21:21,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:21:21,720 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 18:21:21,720 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 18:21:21,721 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:21:21,797 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:21:21,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:21:21,798 INFO L168 Benchmark]: Toolchain (without parser) took 57074.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -103.0 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:21,799 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:21,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.66 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:21,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.25 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:21,801 INFO L168 Benchmark]: Boogie Preprocessor took 91.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:21,801 INFO L168 Benchmark]: RCFGBuilder took 575.31 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. [2018-11-28 18:21:21,802 INFO L168 Benchmark]: TraceAbstraction took 55914.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 110.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:21,803 INFO L168 Benchmark]: Witness Printer took 101.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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:21,806 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.66 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.25 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 575.31 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 55914.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 110.1 MB. Max. memory is 11.5 GB. * Witness Printer took 101.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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 && main__array == 0) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2018-11-28 18:21:21,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:21:21,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((main__array == 0 && !(0 == __VERIFIER_assert__cond)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || (((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 && main__array == 0) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) + unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] <= 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((main__array == 0 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && 4294967296 * (main__index1 / 4294967296) + 4294967296 * ((main__index2 + 4294867297) / 4294967296) + 1 <= main__index1 + 4294967296 * (main__index2 / 4294967296) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((main__array == 0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(0 == __VERIFIER_assert__cond)) || (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 55.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 29.8s AutomataDifference, 0.0s DeadEndRemovalTime, 10.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 225 SDtfs, 262 SDslu, 333 SDs, 0 SdLazy, 222 SolverSat, 34 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 29.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 25 NumberOfFragments, 402 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1681 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 506 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 53569 SizeOfPredicates, 4 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 9/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...