./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i --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/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i -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 eda42c9201fdedd9f50669e53ef2af5b1d7cb675 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:17:48,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:17:48,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:17:48,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:17:48,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:17:48,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:17:48,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:17:48,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:17:48,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:17:48,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:17:48,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:17:48,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:17:48,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:17:48,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:17:48,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:17:48,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:17:48,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:17:48,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:17:48,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:17:48,737 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:17:48,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:17:48,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:17:48,743 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:17:48,743 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:17:48,743 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:17:48,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:17:48,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:17:48,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:17:48,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:17:48,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:17:48,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:17:48,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:17:48,757 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:17:48,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:17:48,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:17:48,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:17:48,762 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:17:48,788 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:17:48,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:17:48,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:17:48,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:17:48,791 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:17:48,792 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:17:48,793 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:17:48,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:17:48,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:17:48,794 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:17:48,794 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:17:48,795 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:17:48,795 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:17:48,795 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:17:48,796 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:17:48,796 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:17:48,796 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:17:48,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:17:48,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:17:48,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:17:48,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:17:48,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:17:48,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:17:48,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:17:48,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:17:48,798 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:17:48,798 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:17:48,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:17:48,798 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 -> eda42c9201fdedd9f50669e53ef2af5b1d7cb675 [2019-01-11 21:17:48,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:17:48,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:17:48,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:17:48,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:17:48,893 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:17:48,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2019-01-11 21:17:48,963 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0f4b96a/c7097474092d4ae1a29d439fde6df115/FLAGe3e51df15 [2019-01-11 21:17:49,389 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:17:49,390 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2019-01-11 21:17:49,396 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0f4b96a/c7097474092d4ae1a29d439fde6df115/FLAGe3e51df15 [2019-01-11 21:17:49,752 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0f4b96a/c7097474092d4ae1a29d439fde6df115 [2019-01-11 21:17:49,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:17:49,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:17:49,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:17:49,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:17:49,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:17:49,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:17:49" (1/1) ... [2019-01-11 21:17:49,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35eebadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:49, skipping insertion in model container [2019-01-11 21:17:49,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:17:49" (1/1) ... [2019-01-11 21:17:49,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:17:49,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:17:50,041 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:17:50,049 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:17:50,075 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:17:50,096 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:17:50,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50 WrapperNode [2019-01-11 21:17:50,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:17:50,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:17:50,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:17:50,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:17:50,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:17:50,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:17:50,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:17:50,140 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:17:50,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (1/1) ... [2019-01-11 21:17:50,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:17:50,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:17:50,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:17:50,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:17:50,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (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-11 21:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-11 21:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:17:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-11 21:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-11 21:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-11 21:17:50,795 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:17:50,795 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-11 21:17:50,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:17:50 BoogieIcfgContainer [2019-01-11 21:17:50,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:17:50,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:17:50,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:17:50,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:17:50,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:17:49" (1/3) ... [2019-01-11 21:17:50,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2acce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:17:50, skipping insertion in model container [2019-01-11 21:17:50,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:17:50" (2/3) ... [2019-01-11 21:17:50,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2acce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:17:50, skipping insertion in model container [2019-01-11 21:17:50,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:17:50" (3/3) ... [2019-01-11 21:17:50,808 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2019-01-11 21:17:50,817 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:17:50,824 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:17:50,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:17:50,878 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:17:50,879 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:17:50,879 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:17:50,880 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:17:50,880 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:17:50,880 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:17:50,880 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:17:50,880 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:17:50,881 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:17:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-01-11 21:17:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 21:17:50,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:50,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:50,910 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:50,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:50,916 INFO L82 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2019-01-11 21:17:50,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:50,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:50,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:51,066 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-11 21:17:51,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:51,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:51,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:51,089 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-01-11 21:17:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:51,272 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-01-11 21:17:51,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:51,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-11 21:17:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:51,287 INFO L225 Difference]: With dead ends: 35 [2019-01-11 21:17:51,288 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 21:17:51,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 21:17:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2019-01-11 21:17:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 21:17:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-11 21:17:51,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-11 21:17:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:51,334 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-11 21:17:51,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-11 21:17:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 21:17:51,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:51,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:51,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:51,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2019-01-11 21:17:51,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:51,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:51,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:51,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:51,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:51,424 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-11 21:17:51,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:51,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:51,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:51,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-11 21:17:51,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:17:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:17:51,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:17:51,562 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2019-01-11 21:17:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:51,672 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-11 21:17:51,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:17:51,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-11 21:17:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:51,673 INFO L225 Difference]: With dead ends: 25 [2019-01-11 21:17:51,673 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 21:17:51,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:17:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 21:17:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2019-01-11 21:17:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 21:17:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-11 21:17:51,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-11 21:17:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:51,680 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-11 21:17:51,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:17:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-11 21:17:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 21:17:51,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:51,681 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:51,681 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash 780776823, now seen corresponding path program 2 times [2019-01-11 21:17:51,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:51,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:51,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:51,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:51,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:17:51,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:51,800 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-11 21:17:51,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 21:17:51,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-11 21:17:51,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:17:51,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-11 21:17:52,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:17:52,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-11 21:17:52,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:17:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:17:52,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:17:52,057 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-11 21:17:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:52,270 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-01-11 21:17:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 21:17:52,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-11 21:17:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:52,272 INFO L225 Difference]: With dead ends: 28 [2019-01-11 21:17:52,272 INFO L226 Difference]: Without dead ends: 18 [2019-01-11 21:17:52,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:17:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-11 21:17:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-11 21:17:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 21:17:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-11 21:17:52,278 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-01-11 21:17:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:52,278 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-11 21:17:52,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:17:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-11 21:17:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:17:52,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:52,279 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:52,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:52,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2073245095, now seen corresponding path program 1 times [2019-01-11 21:17:52,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:52,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:52,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:52,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:17:52,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:17:52,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:52,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:52,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:52,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:17:52,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:52,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-11 21:17:52,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:17:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:17:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:17:52,539 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-11 21:17:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:52,629 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-11 21:17:52,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:17:52,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-11 21:17:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:52,631 INFO L225 Difference]: With dead ends: 28 [2019-01-11 21:17:52,631 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 21:17:52,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:17:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 21:17:52,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-11 21:17:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 21:17:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-11 21:17:52,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-11 21:17:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:52,637 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-11 21:17:52,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:17:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-11 21:17:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:17:52,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:52,638 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:52,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash -184165541, now seen corresponding path program 2 times [2019-01-11 21:17:52,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:52,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:17:52,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:52,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:52,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 21:17:52,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 21:17:52,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:17:52,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:17:52,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:52,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-11 21:17:52,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:17:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:17:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:17:52,856 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-01-11 21:17:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:53,054 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-11 21:17:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:17:53,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-11 21:17:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:53,056 INFO L225 Difference]: With dead ends: 30 [2019-01-11 21:17:53,057 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 21:17:53,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:17:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 21:17:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-11 21:17:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 21:17:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-11 21:17:53,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-11 21:17:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:53,070 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-11 21:17:53,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:17:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-11 21:17:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 21:17:53,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:53,071 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:53,072 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:53,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:53,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1549880355, now seen corresponding path program 3 times [2019-01-11 21:17:53,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:53,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:53,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:17:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:17:53,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:53,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:53,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 21:17:53,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 21:17:53,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:17:53,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-11 21:17:53,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:53,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-01-11 21:17:53,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 21:17:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 21:17:53,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:17:53,891 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-11 21:17:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:54,292 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-01-11 21:17:54,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 21:17:54,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-11 21:17:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:54,295 INFO L225 Difference]: With dead ends: 37 [2019-01-11 21:17:54,295 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 21:17:54,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-11 21:17:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 21:17:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-11 21:17:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 21:17:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-11 21:17:54,304 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2019-01-11 21:17:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-11 21:17:54,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 21:17:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-11 21:17:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:17:54,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:54,306 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:54,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash 36215336, now seen corresponding path program 4 times [2019-01-11 21:17:54,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:54,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:54,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:54,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:17:54,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 21:17:54,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:54,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:54,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 21:17:54,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 21:17:54,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:17:54,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 21:17:54,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:54,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-11 21:17:54,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 21:17:54,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 21:17:54,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:17:54,676 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 11 states. [2019-01-11 21:17:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:54,812 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-11 21:17:54,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 21:17:54,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-01-11 21:17:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:54,814 INFO L225 Difference]: With dead ends: 38 [2019-01-11 21:17:54,814 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 21:17:54,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:17:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 21:17:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-11 21:17:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 21:17:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-11 21:17:54,822 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-01-11 21:17:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:54,824 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-11 21:17:54,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 21:17:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-11 21:17:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:17:54,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:54,825 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:54,825 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:54,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -154825882, now seen corresponding path program 5 times [2019-01-11 21:17:54,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:54,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:17:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 21:17:55,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:55,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:55,013 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-11 21:17:56,425 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-01-11 21:17:56,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:17:56,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 21:17:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:56,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-11 21:17:56,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 21:17:56,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 21:17:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:17:56,486 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-01-11 21:17:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:56,581 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-01-11 21:17:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 21:17:56,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-11 21:17:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:56,591 INFO L225 Difference]: With dead ends: 40 [2019-01-11 21:17:56,591 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 21:17:56,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:17:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 21:17:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-11 21:17:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 21:17:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-01-11 21:17:56,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-01-11 21:17:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:56,601 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-01-11 21:17:56,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 21:17:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-01-11 21:17:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 21:17:56,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:56,604 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:56,604 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 938157348, now seen corresponding path program 6 times [2019-01-11 21:17:56,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:56,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:56,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:17:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 21:17:56,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:56,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:56,975 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-11 21:18:20,922 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-01-11 21:18:20,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:18:20,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:18:21,659 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-01-11 21:18:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-11 21:18:24,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:18:24,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-01-11 21:18:24,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 21:18:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 21:18:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=158, Unknown=1, NotChecked=0, Total=240 [2019-01-11 21:18:24,150 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-01-11 21:18:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:18:33,787 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-01-11 21:18:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 21:18:33,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-01-11 21:18:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:18:33,789 INFO L225 Difference]: With dead ends: 48 [2019-01-11 21:18:33,789 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 21:18:33,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=201, Invalid=350, Unknown=1, NotChecked=0, Total=552 [2019-01-11 21:18:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 21:18:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-01-11 21:18:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 21:18:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-11 21:18:33,812 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-01-11 21:18:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:18:33,813 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-11 21:18:33,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 21:18:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-11 21:18:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:18:33,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:18:33,817 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:18:33,817 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:18:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:18:33,818 INFO L82 PathProgramCache]: Analyzing trace with hash -63893945, now seen corresponding path program 7 times [2019-01-11 21:18:33,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:18:33,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:18:33,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:18:33,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:18:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:18:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:18:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 21:18:34,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:18:34,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:18:34,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:18:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:18:34,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:18:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 21:18:34,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:18:34,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-11 21:18:34,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 21:18:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 21:18:34,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 21:18:34,186 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2019-01-11 21:18:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:18:34,273 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-01-11 21:18:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 21:18:34,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-01-11 21:18:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:18:34,275 INFO L225 Difference]: With dead ends: 45 [2019-01-11 21:18:34,275 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 21:18:34,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 21:18:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 21:18:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-11 21:18:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 21:18:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-11 21:18:34,284 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-11 21:18:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:18:34,285 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-11 21:18:34,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 21:18:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-11 21:18:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 21:18:34,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:18:34,287 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:18:34,288 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:18:34,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:18:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash 64740169, now seen corresponding path program 8 times [2019-01-11 21:18:34,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:18:34,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:18:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:18:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:18:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:18:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:18:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-11 21:18:34,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:18:34,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:18:34,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 21:18:46,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 21:18:46,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-01-11 21:18:46,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:18:46,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-01-11 21:18:46,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:18:46,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:18:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:18:46,860 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2019-01-11 21:18:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:18:47,148 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-01-11 21:18:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 21:18:47,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-01-11 21:18:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:18:47,150 INFO L225 Difference]: With dead ends: 40 [2019-01-11 21:18:47,150 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 21:18:47,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 21:18:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 21:18:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-11 21:18:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 21:18:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-11 21:18:47,162 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-11 21:18:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:18:47,163 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-11 21:18:47,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:18:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-11 21:18:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 21:18:47,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:18:47,165 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:18:47,165 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:18:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:18:47,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2008610624, now seen corresponding path program 9 times [2019-01-11 21:18:47,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:18:47,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:18:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:18:47,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:18:47,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:18:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:18:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-11 21:18:47,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:18:47,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:18:47,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 21:18:48,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 21:18:48,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:18:48,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:18:49,685 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2019-01-11 21:19:08,813 WARN L181 SmtUtils]: Spent 6.62 s on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-01-11 21:19:29,948 WARN L181 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-01-11 21:19:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 13 refuted. 2 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-11 21:19:35,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:19:35,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-01-11 21:19:35,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 21:19:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 21:19:35,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=102, Unknown=12, NotChecked=0, Total=182 [2019-01-11 21:19:35,027 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 14 states. [2019-01-11 21:19:43,897 WARN L181 SmtUtils]: Spent 8.52 s on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-11 21:19:56,505 WARN L181 SmtUtils]: Spent 6.17 s on a formula simplification that was a NOOP. DAG size: 75 [2019-01-11 21:19:58,624 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_14 Int) (v_ULTIMATE.start_main_~c~0_15 Int) (v_ULTIMATE.start_main_~c~0_14 Int)) (let ((.cse5 (mod v_prenex_14 256))) (let ((.cse4 (mod v_ULTIMATE.start_main_~c~0_14 256)) (.cse3 (mod (+ .cse5 4294967248) 4294967296))) (let ((.cse2 (mod (+ .cse4 (* 10 .cse3) 4294967248) 4294967296)) (.cse0 (mod v_ULTIMATE.start_main_~c~0_15 256))) (let ((.cse1 (mod (+ (* 10 .cse2) .cse0 4294967248) 4294967296))) (and (<= 48 .cse0) (= c_ULTIMATE.start_main_~i~0 .cse1) (<= .cse2 2147483647) (<= .cse1 2147483647) (<= .cse3 2147483647) (<= .cse0 57) (<= .cse4 57) (<= 48 .cse5) (<= .cse5 57) (<= 48 .cse4))))))) (exists ((v_ULTIMATE.start_main_~c~0_16 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse12 (mod v_prenex_19 256))) (let ((.cse7 (mod v_prenex_21 256)) (.cse8 (mod (+ .cse12 4294967248) 4294967296))) (let ((.cse6 (mod (+ .cse7 (* 10 .cse8) 4294967248) 4294967296)) (.cse11 (mod v_prenex_20 256))) (let ((.cse13 (mod (+ (* 10 .cse6) .cse11 4294967248) 4294967296)) (.cse10 (mod v_ULTIMATE.start_main_~c~0_16 256))) (let ((.cse9 (mod (+ (* 10 .cse13) .cse10 4294967248) 4294967296))) (and (<= .cse6 2147483647) (<= 48 .cse7) (<= .cse8 2147483647) (<= .cse9 2147483647) (<= .cse10 57) (<= .cse11 57) (<= 48 .cse10) (<= .cse12 57) (<= .cse7 57) (= c_ULTIMATE.start_main_~i~0 .cse9) (<= 48 .cse12) (<= .cse13 2147483647) (<= 48 .cse11))))))))) is different from true [2019-01-11 21:19:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:19:58,673 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-11 21:19:58,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 21:19:58,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-01-11 21:19:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:19:58,676 INFO L225 Difference]: With dead ends: 41 [2019-01-11 21:19:58,676 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 21:19:58,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=96, Invalid=167, Unknown=13, NotChecked=30, Total=306 [2019-01-11 21:19:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 21:19:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 21:19:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 21:19:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-11 21:19:58,685 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-11 21:19:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:19:58,685 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-11 21:19:58,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 21:19:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-11 21:19:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 21:19:58,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:19:58,689 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:19:58,689 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:19:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:19:58,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2139052585, now seen corresponding path program 10 times [2019-01-11 21:19:58,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:19:58,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:19:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:19:58,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:19:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:19:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:19:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-11 21:19:58,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:19:58,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:19:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 21:20:11,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 21:20:11,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-01-11 21:20:11,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:20:11,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-01-11 21:20:11,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 21:20:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 21:20:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 21:20:11,206 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 10 states. [2019-01-11 21:20:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:20:11,541 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-11 21:20:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 21:20:11,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-11 21:20:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:20:11,544 INFO L225 Difference]: With dead ends: 42 [2019-01-11 21:20:11,544 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 21:20:11,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:20:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 21:20:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-11 21:20:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 21:20:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-11 21:20:11,554 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2019-01-11 21:20:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:20:11,554 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-11 21:20:11,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 21:20:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-11 21:20:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 21:20:11,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:20:11,555 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:20:11,556 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:20:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:20:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1887786080, now seen corresponding path program 11 times [2019-01-11 21:20:11,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:20:11,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:20:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:20:11,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:20:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:20:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:20:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-11 21:20:12,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:20:12,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:20:12,643 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-11 21:20:49,875 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-11 21:20:49,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-01-11 21:20:50,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:20:50,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-01-11 21:20:50,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 21:20:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 21:20:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:20:50,961 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 11 states. [2019-01-11 21:20:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:20:51,021 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-11 21:20:51,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 21:20:51,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-01-11 21:20:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:20:51,023 INFO L225 Difference]: With dead ends: 43 [2019-01-11 21:20:51,024 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 21:20:51,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:20:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 21:20:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-11 21:20:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 21:20:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-11 21:20:51,036 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2019-01-11 21:20:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:20:51,037 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-11 21:20:51,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 21:20:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-11 21:20:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 21:20:51,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:20:51,038 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:20:51,040 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:20:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:20:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1606508279, now seen corresponding path program 12 times [2019-01-11 21:20:51,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:20:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:20:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:20:51,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:20:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:20:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:20:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-11 21:20:51,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:20:51,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:20:51,991 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-11 21:22:09,910 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-01-11 21:22:09,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-01-11 21:22:11,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:22:11,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-01-11 21:22:11,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 21:22:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 21:22:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:22:11,198 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 12 states. [2019-01-11 21:22:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:11,678 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-01-11 21:22:11,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 21:22:11,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-01-11 21:22:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:11,679 INFO L225 Difference]: With dead ends: 44 [2019-01-11 21:22:11,679 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 21:22:11,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 21:22:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 21:22:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-11 21:22:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 21:22:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-11 21:22:11,693 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-11 21:22:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:11,693 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-11 21:22:11,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 21:22:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-11 21:22:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 21:22:11,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:11,696 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:11,697 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1739516288, now seen corresponding path program 13 times [2019-01-11 21:22:11,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:11,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:11,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:22:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:16,048 WARN L181 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-11 21:22:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-11 21:22:16,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:22:16,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:22:16,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-01-11 21:22:28,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:22:28,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-01-11 21:22:28,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 21:22:28,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 21:22:28,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 21:22:28,413 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 13 states. [2019-01-11 21:22:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:28,680 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-11 21:22:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 21:22:28,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-01-11 21:22:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:28,681 INFO L225 Difference]: With dead ends: 45 [2019-01-11 21:22:28,681 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 21:22:28,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 21:22:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 21:22:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-11 21:22:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 21:22:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-11 21:22:28,691 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-11 21:22:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:28,691 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-11 21:22:28,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 21:22:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-11 21:22:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 21:22:28,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:28,696 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:28,697 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1907904535, now seen corresponding path program 14 times [2019-01-11 21:22:28,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:28,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:28,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:28,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:28,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:22:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:22:29,657 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:22:29,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:22:29 BoogieIcfgContainer [2019-01-11 21:22:29,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:22:29,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:22:29,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:22:29,704 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:22:29,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:17:50" (3/4) ... [2019-01-11 21:22:29,709 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:22:29,792 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:22:29,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:22:29,795 INFO L168 Benchmark]: Toolchain (without parser) took 280036.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 951.4 MB in the beginning and 835.0 MB in the end (delta: 116.4 MB). Peak memory consumption was 300.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:29,798 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-11 21:22:29,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:29,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.12 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:22:29,799 INFO L168 Benchmark]: Boogie Preprocessor took 47.28 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:29,800 INFO L168 Benchmark]: RCFGBuilder took 609.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:29,800 INFO L168 Benchmark]: TraceAbstraction took 278905.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 842.5 MB in the end (delta: 253.6 MB). Peak memory consumption was 314.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:29,807 INFO L168 Benchmark]: Witness Printer took 89.79 ms. Allocated memory is still 1.2 GB. Free memory was 842.5 MB in the beginning and 835.0 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:29,816 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 336.88 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.12 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.28 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 609.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 278905.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 842.5 MB in the end (delta: 253.6 MB). Peak memory consumption was 314.9 MB. Max. memory is 11.5 GB. * Witness Printer took 89.79 ms. Allocated memory is still 1.2 GB. Free memory was 842.5 MB in the beginning and 835.0 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] char in[11]; [L15] char *s; [L16] unsigned char c; [L17] int i, j; [L18] int idx_in; [L19] i = 0 [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND TRUE i < 11 [L20] in[i] = __VERIFIER_nondet_char() [L19] i++ [L19] COND FALSE !(i < 11) [L21] in[10] = 0 [L22] idx_in = 0 [L23] s = in [L24] i = 0 [L25] EXPR in[idx_in] [L25] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND TRUE ('0' <= c) && (c <= '9') [L28] j = c - '0' [L29] i = i * 10U + j [L30] idx_in++ [L31] EXPR in[idx_in] [L31] c = in[idx_in] [L26] COND FALSE !(('0' <= c) && (c <= '9')) [L6] COND TRUE !(cond) [L7] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. UNSAFE Result, 278.8s OverallTime, 17 OverallIterations, 11 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 112 SDtfs, 157 SDslu, 403 SDs, 0 SdLazy, 573 SolverSat, 128 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 75.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=16, 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 22 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 179.4s SatisfiabilityAnalysisTime, 58.8s InterpolantComputationTime, 864 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 614 ConstructedInterpolants, 11 QuantifiedInterpolants, 61778 SizeOfPredicates, 30 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 1022/1789 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...