./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label16_true-unreach-call_false-termination.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/eca-rers2012/Problem01_label16_true-unreach-call_false-termination.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 82fd55bcca66e80c1d71fa13be1c40df80f8da42 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:51:29,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:51:29,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:51:29,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:51:29,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:51:29,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:51:29,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:51:29,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:51:29,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:51:29,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:51:29,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:51:29,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:51:29,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:51:29,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:51:29,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:51:29,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:51:29,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:51:29,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:51:29,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:51:29,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:51:29,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:51:29,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:51:29,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:51:29,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:51:29,783 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:51:29,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:51:29,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:51:29,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:51:29,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:51:29,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:51:29,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:51:29,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:51:29,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:51:29,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:51:29,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:51:29,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:51:29,794 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:51:29,808 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:51:29,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:51:29,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:51:29,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:51:29,810 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:51:29,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:51:29,810 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:51:29,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:51:29,811 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:51:29,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:51:29,811 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:51:29,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:51:29,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:51:29,811 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:51:29,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:51:29,812 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:51:29,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:51:29,812 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:51:29,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:51:29,812 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:51:29,813 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:51:29,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:51:29,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:51:29,813 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:51:29,813 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:51:29,814 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:51:29,814 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:51:29,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:51:29,814 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 -> 82fd55bcca66e80c1d71fa13be1c40df80f8da42 [2019-01-12 00:51:29,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:51:29,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:51:29,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:51:29,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:51:29,893 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:51:29,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label16_true-unreach-call_false-termination.c [2019-01-12 00:51:29,950 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3707018/e27b2a2c32124bbebeb0dd2f5fa01392/FLAGe2992f707 [2019-01-12 00:51:30,512 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:51:30,512 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label16_true-unreach-call_false-termination.c [2019-01-12 00:51:30,530 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3707018/e27b2a2c32124bbebeb0dd2f5fa01392/FLAGe2992f707 [2019-01-12 00:51:30,777 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3707018/e27b2a2c32124bbebeb0dd2f5fa01392 [2019-01-12 00:51:30,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:51:30,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:51:30,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:51:30,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:51:30,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:51:30,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:51:30" (1/1) ... [2019-01-12 00:51:30,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@683634b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:30, skipping insertion in model container [2019-01-12 00:51:30,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:51:30" (1/1) ... [2019-01-12 00:51:30,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:51:30,864 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:51:31,331 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:51:31,338 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:51:31,462 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:51:31,478 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:51:31,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31 WrapperNode [2019-01-12 00:51:31,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:51:31,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:51:31,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:51:31,480 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:51:31,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:51:31,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:51:31,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:51:31,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:51:31,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (1/1) ... [2019-01-12 00:51:31,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:51:31,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:51:31,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:51:31,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:51:31,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (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 00:51:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:51:31,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:51:34,891 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:51:34,892 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:51:34,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:51:34 BoogieIcfgContainer [2019-01-12 00:51:34,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:51:34,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:51:34,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:51:34,898 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:51:34,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:51:30" (1/3) ... [2019-01-12 00:51:34,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52333a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:51:34, skipping insertion in model container [2019-01-12 00:51:34,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:31" (2/3) ... [2019-01-12 00:51:34,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52333a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:51:34, skipping insertion in model container [2019-01-12 00:51:34,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:51:34" (3/3) ... [2019-01-12 00:51:34,901 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label16_true-unreach-call_false-termination.c [2019-01-12 00:51:34,911 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:51:34,919 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:51:34,936 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:51:34,971 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:51:34,972 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:51:34,972 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:51:34,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:51:34,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:51:34,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:51:34,973 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:51:34,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:51:34,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:51:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:51:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-12 00:51:35,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:35,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:35,016 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:35,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1597904809, now seen corresponding path program 1 times [2019-01-12 00:51:35,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:35,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:35,768 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:51:35,919 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-12 00:51:36,253 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-12 00:51:36,670 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-01-12 00:51:36,878 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-12 00:51:37,094 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 00:51:37,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:37,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 00:51:37,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 00:51:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 00:51:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:51:37,116 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-01-12 00:51:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:39,375 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-01-12 00:51:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:51:39,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-01-12 00:51:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:39,392 INFO L225 Difference]: With dead ends: 493 [2019-01-12 00:51:39,393 INFO L226 Difference]: Without dead ends: 193 [2019-01-12 00:51:39,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-01-12 00:51:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-12 00:51:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-12 00:51:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-12 00:51:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-01-12 00:51:39,446 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 130 [2019-01-12 00:51:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:39,447 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-01-12 00:51:39,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 00:51:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-01-12 00:51:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-12 00:51:39,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:39,451 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:39,452 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2062675825, now seen corresponding path program 1 times [2019-01-12 00:51:39,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:39,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:39,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:39,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:51:39,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:39,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:51:39,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:51:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:51:39,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:39,707 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 4 states. [2019-01-12 00:51:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:40,684 INFO L93 Difference]: Finished difference Result 588 states and 859 transitions. [2019-01-12 00:51:40,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:51:40,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-01-12 00:51:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:40,691 INFO L225 Difference]: With dead ends: 588 [2019-01-12 00:51:40,691 INFO L226 Difference]: Without dead ends: 455 [2019-01-12 00:51:40,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-01-12 00:51:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 324. [2019-01-12 00:51:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-01-12 00:51:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 437 transitions. [2019-01-12 00:51:40,722 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 437 transitions. Word has length 134 [2019-01-12 00:51:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:40,723 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 437 transitions. [2019-01-12 00:51:40,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:51:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 437 transitions. [2019-01-12 00:51:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-12 00:51:40,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:40,727 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:40,728 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2061250518, now seen corresponding path program 1 times [2019-01-12 00:51:40,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:40,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:40,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:40,983 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 00:51:41,230 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 00:51:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:51:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:51:41,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:51:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:51:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:41,369 INFO L87 Difference]: Start difference. First operand 324 states and 437 transitions. Second operand 4 states. [2019-01-12 00:51:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:42,867 INFO L93 Difference]: Finished difference Result 814 states and 1168 transitions. [2019-01-12 00:51:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:51:42,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-01-12 00:51:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:42,879 INFO L225 Difference]: With dead ends: 814 [2019-01-12 00:51:42,879 INFO L226 Difference]: Without dead ends: 455 [2019-01-12 00:51:42,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-01-12 00:51:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-01-12 00:51:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-12 00:51:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 536 transitions. [2019-01-12 00:51:42,939 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 536 transitions. Word has length 137 [2019-01-12 00:51:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:42,939 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 536 transitions. [2019-01-12 00:51:42,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:51:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 536 transitions. [2019-01-12 00:51:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 00:51:42,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:42,947 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:42,947 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1412559080, now seen corresponding path program 1 times [2019-01-12 00:51:42,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:42,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:42,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:51:43,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:43,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:51:43,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:51:43,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:51:43,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:51:43,102 INFO L87 Difference]: Start difference. First operand 455 states and 536 transitions. Second operand 3 states. [2019-01-12 00:51:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:43,697 INFO L93 Difference]: Finished difference Result 981 states and 1171 transitions. [2019-01-12 00:51:43,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:51:43,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-01-12 00:51:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:43,704 INFO L225 Difference]: With dead ends: 981 [2019-01-12 00:51:43,704 INFO L226 Difference]: Without dead ends: 586 [2019-01-12 00:51:43,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 00:51:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-01-12 00:51:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-01-12 00:51:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-01-12 00:51:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 676 transitions. [2019-01-12 00:51:43,721 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 676 transitions. Word has length 145 [2019-01-12 00:51:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:43,721 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 676 transitions. [2019-01-12 00:51:43,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:51:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 676 transitions. [2019-01-12 00:51:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 00:51:43,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:43,725 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:43,725 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1731311838, now seen corresponding path program 1 times [2019-01-12 00:51:43,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:43,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:43,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:43,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:43,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:51:43,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:43,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:51:43,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:51:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:51:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:51:43,930 INFO L87 Difference]: Start difference. First operand 586 states and 676 transitions. Second operand 5 states. [2019-01-12 00:51:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:46,069 INFO L93 Difference]: Finished difference Result 1898 states and 2221 transitions. [2019-01-12 00:51:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:51:46,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-01-12 00:51:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:46,078 INFO L225 Difference]: With dead ends: 1898 [2019-01-12 00:51:46,079 INFO L226 Difference]: Without dead ends: 1372 [2019-01-12 00:51:46,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:51:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-01-12 00:51:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1241. [2019-01-12 00:51:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-01-12 00:51:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1410 transitions. [2019-01-12 00:51:46,110 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1410 transitions. Word has length 149 [2019-01-12 00:51:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:46,110 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 1410 transitions. [2019-01-12 00:51:46,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:51:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1410 transitions. [2019-01-12 00:51:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 00:51:46,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:46,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:46,115 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash 911359967, now seen corresponding path program 1 times [2019-01-12 00:51:46,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:46,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:46,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:51:46,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:46,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 00:51:46,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 00:51:46,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 00:51:46,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-12 00:51:46,966 INFO L87 Difference]: Start difference. First operand 1241 states and 1410 transitions. Second operand 12 states. [2019-01-12 00:51:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:49,172 INFO L93 Difference]: Finished difference Result 2794 states and 3292 transitions. [2019-01-12 00:51:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 00:51:49,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2019-01-12 00:51:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:49,185 INFO L225 Difference]: With dead ends: 2794 [2019-01-12 00:51:49,185 INFO L226 Difference]: Without dead ends: 1579 [2019-01-12 00:51:49,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-01-12 00:51:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2019-01-12 00:51:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1538. [2019-01-12 00:51:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-01-12 00:51:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1742 transitions. [2019-01-12 00:51:49,222 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1742 transitions. Word has length 167 [2019-01-12 00:51:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:49,222 INFO L480 AbstractCegarLoop]: Abstraction has 1538 states and 1742 transitions. [2019-01-12 00:51:49,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 00:51:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1742 transitions. [2019-01-12 00:51:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-12 00:51:49,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:49,228 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:49,228 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1583433812, now seen corresponding path program 1 times [2019-01-12 00:51:49,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:49,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:49,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:49,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:49,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:49,473 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 00:51:49,658 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 00:51:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 00:51:49,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:51:49,786 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 00:51:49,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:49,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:51:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-12 00:51:50,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:51:50,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 00:51:50,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:51:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:51:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:51:50,050 INFO L87 Difference]: Start difference. First operand 1538 states and 1742 transitions. Second operand 8 states. [2019-01-12 00:51:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:53,957 INFO L93 Difference]: Finished difference Result 4361 states and 4935 transitions. [2019-01-12 00:51:53,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:51:53,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-01-12 00:51:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:53,971 INFO L225 Difference]: With dead ends: 4361 [2019-01-12 00:51:53,971 INFO L226 Difference]: Without dead ends: 2883 [2019-01-12 00:51:53,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 00:51:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-01-12 00:51:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2883. [2019-01-12 00:51:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-01-12 00:51:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 3180 transitions. [2019-01-12 00:51:54,032 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 3180 transitions. Word has length 193 [2019-01-12 00:51:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:54,032 INFO L480 AbstractCegarLoop]: Abstraction has 2883 states and 3180 transitions. [2019-01-12 00:51:54,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:51:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3180 transitions. [2019-01-12 00:51:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-01-12 00:51:54,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:54,040 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:54,040 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1602224280, now seen corresponding path program 1 times [2019-01-12 00:51:54,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:54,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:54,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:54,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:54,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:54,413 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 00:51:54,680 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 00:51:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 27 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 00:51:55,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:51:55,033 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 [2019-01-12 00:51:55,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:55,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:51:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-12 00:51:55,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:51:55,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 00:51:55,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:51:55,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:51:55,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:51:55,289 INFO L87 Difference]: Start difference. First operand 2883 states and 3180 transitions. Second operand 7 states. [2019-01-12 00:51:56,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:56,653 INFO L93 Difference]: Finished difference Result 6109 states and 6759 transitions. [2019-01-12 00:51:56,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 00:51:56,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2019-01-12 00:51:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:56,655 INFO L225 Difference]: With dead ends: 6109 [2019-01-12 00:51:56,656 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:51:56,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:51:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:51:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:51:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:51:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:51:56,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2019-01-12 00:51:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:56,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:51:56,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:51:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:51:56,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:51:56,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:51:57,161 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-12 00:51:57,521 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,525 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:51:57,526 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:51:57,527 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:51:57,528 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:51:57,529 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:51:57,530 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:51:57,530 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:51:57,530 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:51:57,530 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:51:57,530 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:51:57,530 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:51:57,531 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a8~0 15)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a7~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse4 (<= ~a7~0 0)) (.cse0 (not .cse10)) (.cse2 (= ~a17~0 1)) (.cse8 (<= ~a21~0 0)) (.cse9 (or (and .cse7 .cse1) .cse5)) (.cse3 (= ~a12~0 8))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1 .cse4) (and .cse5 .cse6 (= ~a8~0 13) .cse2 .cse3 .cse1) (and .cse7 .cse6 .cse3 .cse1) (and .cse6 .cse1 .cse4) (and .cse0 .cse8 .cse2) (and (not .cse5) .cse7 (or (= 3 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse3 .cse1 (= ~a16~0 6) (not .cse2)) (and .cse9 .cse3 .cse1 (= ~a16~0 5)) (and .cse8 .cse9 .cse3 .cse10)))) [2019-01-12 00:51:57,531 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,531 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,531 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 566) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:51:57,532 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:51:57,533 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:51:57,534 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,535 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:51:57,536 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:51:57,537 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:51:57,537 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:51:57,537 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:51:57,537 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:51:57,537 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:51:57,537 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:51:57,537 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a8~0 15)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a7~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse4 (<= ~a7~0 0)) (.cse0 (not .cse10)) (.cse2 (= ~a17~0 1)) (.cse8 (<= ~a21~0 0)) (.cse9 (or (and .cse7 .cse1) .cse5)) (.cse3 (= ~a12~0 8))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1 .cse4) (and .cse5 .cse6 (= ~a8~0 13) .cse2 .cse3 .cse1) (and .cse7 .cse6 .cse3 .cse1) (and .cse6 .cse1 .cse4) (and .cse0 .cse8 .cse2) (and (not .cse5) .cse7 (or (= 3 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse3 .cse1 (= ~a16~0 6) (not .cse2)) (and .cse9 .cse3 .cse1 (= ~a16~0 5)) (and .cse8 .cse9 .cse3 .cse10)))) [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:51:57,538 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,539 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:51:57,540 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,541 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:51:57,542 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:51:57,543 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:51:57,544 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,545 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:51:57,546 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:51:57,547 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:51:57,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:51:57 BoogieIcfgContainer [2019-01-12 00:51:57,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:51:57,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:51:57,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:51:57,602 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:51:57,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:51:34" (3/4) ... [2019-01-12 00:51:57,616 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:51:57,675 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:51:57,677 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:51:57,876 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:51:57,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:51:57,877 INFO L168 Benchmark]: Toolchain (without parser) took 27096.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 380.6 MB). Free memory was 946.0 MB in the beginning and 925.4 MB in the end (delta: 20.6 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:57,878 INFO L168 Benchmark]: CDTParser took 0.16 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 00:51:57,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.11 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:57,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 189.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:57,879 INFO L168 Benchmark]: Boogie Preprocessor took 98.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:57,879 INFO L168 Benchmark]: RCFGBuilder took 3124.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:57,880 INFO L168 Benchmark]: TraceAbstraction took 22706.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 947.5 MB in the end (delta: 66.9 MB). Peak memory consumption was 313.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:57,880 INFO L168 Benchmark]: Witness Printer took 274.63 ms. Allocated memory is still 1.4 GB. Free memory was 947.5 MB in the beginning and 925.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:57,882 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.16 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 697.11 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 189.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3124.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22706.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 947.5 MB in the end (delta: 66.9 MB). Peak memory consumption was 313.8 MB. Max. memory is 11.5 GB. * Witness Printer took 274.63 ms. Allocated memory is still 1.4 GB. Free memory was 947.5 MB in the beginning and 925.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && a21 == 1) || (((a17 == 1 && a12 == 8) && a21 == 1) && a7 <= 0)) || (((((a7 == 1 && a16 == 4) && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a8 == 15 && a16 == 4) && a12 == 8) && a21 == 1)) || ((a16 == 4 && a21 == 1) && a7 <= 0)) || ((!(a20 == 1) && a21 <= 0) && a17 == 1)) || ((((((!(a7 == 1) && a8 == 15) && (((((3 == input || input == 2) || input == 4) || 1 == input) || 5 == input) || input == 6)) && a12 == 8) && a21 == 1) && a16 == 6) && !(a17 == 1))) || (((((a8 == 15 && a21 == 1) || a7 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || (((a21 <= 0 && ((a8 == 15 && a21 == 1) || a7 == 1)) && a12 == 8) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && a21 == 1) || (((a17 == 1 && a12 == 8) && a21 == 1) && a7 <= 0)) || (((((a7 == 1 && a16 == 4) && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a8 == 15 && a16 == 4) && a12 == 8) && a21 == 1)) || ((a16 == 4 && a21 == 1) && a7 <= 0)) || ((!(a20 == 1) && a21 <= 0) && a17 == 1)) || ((((((!(a7 == 1) && a8 == 15) && (((((3 == input || input == 2) || input == 4) || 1 == input) || 5 == input) || input == 6)) && a12 == 8) && a21 == 1) && a16 == 6) && !(a17 == 1))) || (((((a8 == 15 && a21 == 1) || a7 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || (((a21 <= 0 && ((a8 == 15 && a21 == 1) || a7 == 1)) && a12 == 8) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 22.5s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 634 SDtfs, 3392 SDslu, 193 SDs, 0 SdLazy, 7462 SolverSat, 854 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 435 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2883occurred in iteration=7, 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 303 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 68 NumberOfFragments, 315 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1562 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 286 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1712 NumberOfCodeBlocks, 1712 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1702 ConstructedInterpolants, 0 QuantifiedInterpolants, 1644562 SizeOfPredicates, 2 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 627/665 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...