./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 0ed9222f 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-0ed9222-m [2019-01-12 11:16:33,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:16:33,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:16:33,799 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:16:33,799 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:16:33,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:16:33,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:16:33,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:16:33,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:16:33,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:16:33,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:16:33,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:16:33,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:16:33,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:16:33,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:16:33,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:16:33,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:16:33,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:16:33,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:16:33,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:16:33,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:16:33,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:16:33,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:16:33,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:16:33,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:16:33,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:16:33,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:16:33,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:16:33,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:16:33,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:16:33,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:16:33,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:16:33,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:16:33,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:16:33,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:16:33,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:16:33,832 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:16:33,872 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:16:33,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:16:33,879 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:16:33,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:16:33,879 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:16:33,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:16:33,880 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:16:33,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:16:33,880 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:16:33,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:16:33,880 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:16:33,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:16:33,881 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:16:33,881 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:16:33,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:16:33,882 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:16:33,882 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:16:33,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:16:33,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:16:33,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:16:33,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:16:33,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:16:33,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:16:33,883 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:16:33,883 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:16:33,884 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:16:33,886 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:16:33,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:16:33,886 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 [2019-01-12 11:16:33,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:16:33,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:16:33,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:16:33,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:16:33,947 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:16:33,947 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 [2019-01-12 11:16:34,000 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b277bbd15/ca300bc975c6479bbebc36dbacb5942e/FLAG651be28fb [2019-01-12 11:16:34,476 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:16:34,477 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2019-01-12 11:16:34,484 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b277bbd15/ca300bc975c6479bbebc36dbacb5942e/FLAG651be28fb [2019-01-12 11:16:34,830 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b277bbd15/ca300bc975c6479bbebc36dbacb5942e [2019-01-12 11:16:34,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:16:34,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:16:34,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:16:34,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:16:34,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:16:34,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:16:34" (1/1) ... [2019-01-12 11:16:34,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d04184c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:34, skipping insertion in model container [2019-01-12 11:16:34,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:16:34" (1/1) ... [2019-01-12 11:16:34,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:16:34,879 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:16:35,047 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:16:35,053 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:16:35,087 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:16:35,109 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:16:35,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35 WrapperNode [2019-01-12 11:16:35,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:16:35,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:16:35,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:16:35,111 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:16:35,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:16:35,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:16:35,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:16:35,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:16:35,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (1/1) ... [2019-01-12 11:16:35,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:16:35,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:16:35,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:16:35,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:16:35,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (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 [2019-01-12 11:16:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:16:35,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:16:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 11:16:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 11:16:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 11:16:35,824 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:16:35,825 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:16:35,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:16:35 BoogieIcfgContainer [2019-01-12 11:16:35,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:16:35,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:16:35,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:16:35,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:16:35,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:16:34" (1/3) ... [2019-01-12 11:16:35,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebc8ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:16:35, skipping insertion in model container [2019-01-12 11:16:35,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:16:35" (2/3) ... [2019-01-12 11:16:35,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebc8ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:16:35, skipping insertion in model container [2019-01-12 11:16:35,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:16:35" (3/3) ... [2019-01-12 11:16:35,834 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2019-01-12 11:16:35,844 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:16:35,852 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-12 11:16:35,870 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-12 11:16:35,901 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:16:35,901 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:16:35,901 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:16:35,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:16:35,902 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:16:35,902 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:16:35,902 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:16:35,902 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:16:35,902 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:16:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-12 11:16:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:16:35,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:35,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:35,927 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash -549247241, now seen corresponding path program 1 times [2019-01-12 11:16:35,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:35,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:35,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:35,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:36,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:36,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:16:36,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:16:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:16:36,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:16:36,116 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-01-12 11:16:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:36,177 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2019-01-12 11:16:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:16:36,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-12 11:16:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:36,192 INFO L225 Difference]: With dead ends: 51 [2019-01-12 11:16:36,192 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 11:16:36,195 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 [2019-01-12 11:16:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 11:16:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-12 11:16:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 11:16:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-12 11:16:36,230 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2019-01-12 11:16:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:36,231 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-12 11:16:36,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:16:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-01-12 11:16:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:16:36,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:36,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:36,232 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2084862863, now seen corresponding path program 1 times [2019-01-12 11:16:36,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:36,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:36,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:36,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:16:36,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:16:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:16:36,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:16:36,290 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-01-12 11:16:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:36,401 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-01-12 11:16:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:16:36,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 11:16:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:36,403 INFO L225 Difference]: With dead ends: 56 [2019-01-12 11:16:36,403 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 11:16:36,404 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 [2019-01-12 11:16:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 11:16:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-12 11:16:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 11:16:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-12 11:16:36,410 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2019-01-12 11:16:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:36,410 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-12 11:16:36,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:16:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-12 11:16:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:16:36,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:36,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:36,411 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2019-01-12 11:16:36,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:36,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:36,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:36,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:36,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:16:36,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:16:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:16:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:16:36,539 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-01-12 11:16:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:36,720 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-01-12 11:16:36,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:16:36,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-12 11:16:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:36,722 INFO L225 Difference]: With dead ends: 49 [2019-01-12 11:16:36,722 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 11:16:36,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:16:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 11:16:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2019-01-12 11:16:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 11:16:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 11:16:36,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 10 [2019-01-12 11:16:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:36,730 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 11:16:36,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:16:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 11:16:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:16:36,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:36,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:36,731 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1998916233, now seen corresponding path program 1 times [2019-01-12 11:16:36,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:36,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:36,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:36,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:16:36,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:16:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:16:36,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:16:36,764 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2019-01-12 11:16:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:36,822 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-01-12 11:16:36,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:16:36,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-12 11:16:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:36,823 INFO L225 Difference]: With dead ends: 52 [2019-01-12 11:16:36,824 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 11:16:36,824 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 [2019-01-12 11:16:36,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 11:16:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-01-12 11:16:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 11:16:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-12 11:16:36,829 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2019-01-12 11:16:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:36,829 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-12 11:16:36,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:16:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-12 11:16:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:16:36,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:36,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:36,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 588855308, now seen corresponding path program 1 times [2019-01-12 11:16:36,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:36,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:37,417 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-12 11:16:38,090 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-01-12 11:16:38,924 WARN L181 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 38 [2019-01-12 11:16:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:39,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:39,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 11:16:39,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:16:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:16:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:16:39,047 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2019-01-12 11:16:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:39,621 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-01-12 11:16:39,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 11:16:39,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-12 11:16:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:39,623 INFO L225 Difference]: With dead ends: 45 [2019-01-12 11:16:39,623 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 11:16:39,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:16:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 11:16:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-12 11:16:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 11:16:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 11:16:39,630 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2019-01-12 11:16:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:39,630 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 11:16:39,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:16:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 11:16:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 11:16:39,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:39,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:39,632 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:39,632 INFO L82 PathProgramCache]: Analyzing trace with hash 394194232, now seen corresponding path program 1 times [2019-01-12 11:16:39,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:39,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:39,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:39,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:39,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:39,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:16:39,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:16:39,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:16:39,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:16:39,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:16:39,705 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2019-01-12 11:16:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:39,814 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-01-12 11:16:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:16:39,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 11:16:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:39,818 INFO L225 Difference]: With dead ends: 40 [2019-01-12 11:16:39,818 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 11:16:39,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:16:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 11:16:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2019-01-12 11:16:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 11:16:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-12 11:16:39,824 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2019-01-12 11:16:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:39,824 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-12 11:16:39,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:16:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-12 11:16:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 11:16:39,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:16:39,825 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:16:39,826 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:16:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:16:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1945950452, now seen corresponding path program 1 times [2019-01-12 11:16:39,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:16:39,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:16:39,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:39,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:16:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:40,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:16:40,045 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 [2019-01-12 11:16:40,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:16:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:16:40,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:16:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:16:40,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:16:40,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-01-12 11:16:40,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:16:40,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:16:40,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:16:40,437 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-01-12 11:16:43,642 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-12 11:16:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:16:50,349 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-12 11:16:50,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:16:50,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-01-12 11:16:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:16:50,538 INFO L225 Difference]: With dead ends: 28 [2019-01-12 11:16:50,538 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:16:50,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:16:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:16:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:16:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:16:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:16:50,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-12 11:16:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:16:50,541 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:16:50,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:16:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:16:50,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:16:50,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:16:50,749 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-01-12 11:16:51,911 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-12 11:16:51,940 INFO L451 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-01-12 11:16:51,940 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-01-12 11:16:51,940 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-01-12 11:16:51,940 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-01-12 11:16:51,941 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-01-12 11:16:51,941 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-01-12 11:16:51,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:16:51,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:16:51,941 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-01-12 11:16:51,941 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 11:16:51,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-01-12 11:16:51,942 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-01-12 11:16:51,942 INFO L444 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-01-12 11:16:51,942 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-01-12 11:16:51,942 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-01-12 11:16:51,942 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 11:16:51,942 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-01-12 11:16:51,942 INFO L444 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-01-12 11:16:51,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-01-12 11:16:51,943 INFO L444 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse9 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse11 (* 4294967296 .cse9)) (.cse10 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse2 (* 4294967296 .cse10)) (.cse1 (+ ULTIMATE.start_main_~main__index2~0 .cse11)) (.cse3 (<= ULTIMATE.start_main_~main__index1~0 (+ .cse11 99999)))) (or (and .cse0 (<= .cse1 (+ ULTIMATE.start_main_~main__index1~0 .cse2 99999)) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse2 1) .cse1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse3) (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296)) 100000)) .cse0 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse2 99999)) (or (<= (+ ULTIMATE.start_main_~main__index1~0 .cse2) .cse1) (let ((.cse8 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse6 (select .cse8 (+ (* 4 ULTIMATE.start_main_~main__index2~0) (* (- 17179869184) .cse10) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse7 (select .cse8 (+ (* 4 ULTIMATE.start_main_~main__index1~0) (* (- 17179869184) .cse9) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse5 (+ (* 4294967296 (div .cse6 4294967296)) .cse7)) (.cse4 (+ .cse6 (* 4294967296 (div .cse7 4294967296))))) (and (<= .cse4 .cse5) (<= .cse5 .cse4)))))) .cse3 (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (- ULTIMATE.start_main_~main__index2~0) (+ ULTIMATE.start_main_~main__index1~0 99997)) 4294967296)) 1))))))) [2019-01-12 11:16:51,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-01-12 11:16:51,944 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:16:51,946 INFO L451 ceAbstractionStarter]: At program point L189(lines 9 191) the Hoare annotation is: true [2019-01-12 11:16:51,946 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-01-12 11:16:51,946 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-01-12 11:16:51,946 INFO L444 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296)) 100000)) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0)) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (- ULTIMATE.start_main_~main__index2~0) (+ ULTIMATE.start_main_~main__index1~0 99997)) 4294967296)) 1)))) [2019-01-12 11:16:51,947 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-01-12 11:16:51,947 INFO L444 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse1 (<= (+ ULTIMATE.start_main_~main__index1~0 .cse3 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296))))) (.cse2 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse3 99999)))) (or (and .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) .cse1 .cse2 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~main____CPAchecker_TMP_0~0))))) [2019-01-12 11:16:51,947 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-01-12 11:16:51,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-01-12 11:16:51,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:16:51,948 INFO L444 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1))) [2019-01-12 11:16:51,948 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-01-12 11:16:51,948 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-01-12 11:16:51,948 INFO L444 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296)) 100000)) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (- ULTIMATE.start_main_~main__index2~0) (+ ULTIMATE.start_main_~main__index1~0 99997)) 4294967296)) 1))) [2019-01-12 11:16:51,948 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 11:16:51,948 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-01-12 11:16:51,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:51,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:16:52 BoogieIcfgContainer [2019-01-12 11:16:52,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:16:52,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:16:52,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:16:52,007 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:16:52,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:16:35" (3/4) ... [2019-01-12 11:16:52,013 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:16:52,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-12 11:16:52,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:16:52,130 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:16:52,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:16:52,134 INFO L168 Benchmark]: Toolchain (without parser) took 17299.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 948.7 MB in the beginning and 811.5 MB in the end (delta: 137.2 MB). Peak memory consumption was 246.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:16:52,135 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. [2019-01-12 11:16:52,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:16:52,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.20 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:16:52,137 INFO L168 Benchmark]: Boogie Preprocessor took 115.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:16:52,138 INFO L168 Benchmark]: RCFGBuilder took 548.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-01-12 11:16:52,139 INFO L168 Benchmark]: TraceAbstraction took 16178.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 818.3 MB in the end (delta: 259.5 MB). Peak memory consumption was 259.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:16:52,139 INFO L168 Benchmark]: Witness Printer took 126.82 ms. Allocated memory is still 1.1 GB. Free memory was 818.3 MB in the beginning and 811.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:16:52,141 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 273.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 51.20 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 115.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 548.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16178.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 818.3 MB in the end (delta: 259.5 MB). Peak memory consumption was 259.5 MB. Max. memory is 11.5 GB. * Witness Printer took 126.82 ms. Allocated memory is still 1.1 GB. Free memory was 818.3 MB in the beginning and 811.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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: 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: 41]: Loop Invariant Derived loop invariant: ((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && !(main____CPAchecker_TMP_0 == 0)) || (((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && 1 == main____CPAchecker_TMP_0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 100000 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 <= main__index2 + 4294967296 * ((-main__index2 + (main__index1 + 99997)) / 4294967296) + 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2019-01-12 11:16:52,149 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,149 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,150 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,150 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,150 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,150 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 11:16:52,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((__VERIFIER_assert__cond == 1 && main__index2 + 4294967296 * (main__index1 / 4294967296) <= main__index1 + 4294967296 * (main__index2 / 4294967296) + 99999) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && !(__VERIFIER_assert__cond == 0)) && main__index1 <= 4294967296 * (main__index1 / 4294967296) + 99999) || (((((main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 100000 && __VERIFIER_assert__cond == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && (main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296) || (unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] / 4294967296) <= 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] && 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] <= unknown-#memory_int-unknown[main__array][4 * main__index2 + -17179869184 * (main__index2 / 4294967296) + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index1 + -17179869184 * (main__index1 / 4294967296) + main__array] / 4294967296)))) && main__index1 <= 4294967296 * (main__index1 / 4294967296) + 99999) && main__index1 <= main__index2 + 4294967296 * ((-main__index2 + (main__index1 + 99997)) / 4294967296) + 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 100000 && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && !(main____CPAchecker_TMP_0 == 0)) && main__index1 <= main__index2 + 4294967296 * ((-main__index2 + (main__index1 + 99997)) / 4294967296) + 1 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__loop_entered == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 4 error locations. SAFE Result, 16.0s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 179 SDslu, 213 SDs, 0 SdLazy, 180 SolverSat, 20 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 7 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 19 NumberOfFragments, 448 HoareAnnotationTreeSize, 9 FomulaSimplifications, 784 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 170 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 22094 SizeOfPredicates, 2 NumberOfNonLiveVariables, 83 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...