./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_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 5f5357e64289d6bac41f74df7b40a85eebbaa806 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-91b1670 [2018-11-28 18:17:24,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:17:24,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:17:24,840 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:17:24,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:17:24,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:17:24,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:17:24,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:17:24,849 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:17:24,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:17:24,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:17:24,855 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:17:24,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:17:24,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:17:24,867 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:17:24,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:17:24,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:17:24,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:17:24,873 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:17:24,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:17:24,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:17:24,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:17:24,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:17:24,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:17:24,881 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:17:24,882 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:17:24,883 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:17:24,884 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:17:24,885 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:17:24,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:17:24,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:17:24,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:17:24,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:17:24,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:17:24,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:17:24,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:17:24,889 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:17:24,904 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:17:24,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:17:24,905 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:17:24,905 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:17:24,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:17:24,906 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:17:24,906 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:17:24,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:17:24,906 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:17:24,906 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:17:24,906 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:17:24,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:17:24,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:17:24,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:17:24,907 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:17:24,907 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:17:24,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:17:24,908 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:17:24,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:17:24,908 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:17:24,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:17:24,908 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:17:24,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:17:24,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:17:24,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:17:24,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:17:24,909 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:17:24,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:17:24,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:17:24,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:17:24,910 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 -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2018-11-28 18:17:24,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:17:24,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:17:24,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:17:24,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:17:24,975 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:17:24,976 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-28 18:17:25,046 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11406488/7d785ab5c27a4902b141f1f245c4f252/FLAGf9bac42ff [2018-11-28 18:17:25,580 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:17:25,580 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-28 18:17:25,588 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11406488/7d785ab5c27a4902b141f1f245c4f252/FLAGf9bac42ff [2018-11-28 18:17:25,897 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11406488/7d785ab5c27a4902b141f1f245c4f252 [2018-11-28 18:17:25,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:17:25,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:17:25,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:17:25,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:17:25,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:17:25,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:17:25" (1/1) ... [2018-11-28 18:17:25,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e92b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:25, skipping insertion in model container [2018-11-28 18:17:25,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:17:25" (1/1) ... [2018-11-28 18:17:25,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:17:25,947 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:17:26,222 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:17:26,240 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:17:26,303 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:17:26,337 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:17:26,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26 WrapperNode [2018-11-28 18:17:26,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:17:26,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:17:26,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:17:26,339 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:17:26,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:17:26,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:17:26,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:17:26,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:17:26,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... [2018-11-28 18:17:26,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:17:26,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:17:26,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:17:26,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:17:26,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:17:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-28 18:17:26,590 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2018-11-28 18:17:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:17:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:17:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:17:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-28 18:17:26,591 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-28 18:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:17:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2018-11-28 18:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:17:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:17:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 18:17:26,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 18:17:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:17:27,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:17:27,227 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 18:17:27,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:27 BoogieIcfgContainer [2018-11-28 18:17:27,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:17:27,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:17:27,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:17:27,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:17:27,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:17:25" (1/3) ... [2018-11-28 18:17:27,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42439a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:17:27, skipping insertion in model container [2018-11-28 18:17:27,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26" (2/3) ... [2018-11-28 18:17:27,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42439a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:17:27, skipping insertion in model container [2018-11-28 18:17:27,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:27" (3/3) ... [2018-11-28 18:17:27,238 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-28 18:17:27,250 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:17:27,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:17:27,277 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:17:27,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:17:27,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:17:27,311 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:17:27,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:17:27,312 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:17:27,312 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:17:27,312 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:17:27,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:17:27,313 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:17:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-28 18:17:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 18:17:27,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:27,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:27,345 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:27,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1431465242, now seen corresponding path program 1 times [2018-11-28 18:17:27,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:27,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:27,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:27,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:27,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:27,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:27,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:17:27,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:17:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:17:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:17:27,597 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-28 18:17:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:27,623 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2018-11-28 18:17:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:17:27,625 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-28 18:17:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:27,634 INFO L225 Difference]: With dead ends: 93 [2018-11-28 18:17:27,635 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 18:17:27,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:17:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 18:17:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 18:17:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 18:17:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-28 18:17:27,685 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2018-11-28 18:17:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:27,686 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-28 18:17:27,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:17:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-28 18:17:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:17:27,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:27,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:27,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:27,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1642980317, now seen corresponding path program 1 times [2018-11-28 18:17:27,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:27,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:27,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:27,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:17:27,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:17:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:17:27,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:17:27,831 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2018-11-28 18:17:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:27,870 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-11-28 18:17:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:17:27,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 18:17:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:27,872 INFO L225 Difference]: With dead ends: 78 [2018-11-28 18:17:27,873 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 18:17:27,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:17:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 18:17:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 18:17:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 18:17:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-28 18:17:27,882 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2018-11-28 18:17:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:27,883 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-28 18:17:27,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:17:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-28 18:17:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:17:27,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:27,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:27,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:27,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2065682143, now seen corresponding path program 1 times [2018-11-28 18:17:27,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:27,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:27,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:27,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:27,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:28,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:28,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:17:28,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:17:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:17:28,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:17:28,030 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 5 states. [2018-11-28 18:17:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:28,254 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2018-11-28 18:17:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:17:28,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-28 18:17:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:28,262 INFO L225 Difference]: With dead ends: 106 [2018-11-28 18:17:28,262 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 18:17:28,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:17:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 18:17:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-11-28 18:17:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 18:17:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-11-28 18:17:28,277 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 33 [2018-11-28 18:17:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:28,278 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2018-11-28 18:17:28,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:17:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-11-28 18:17:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:17:28,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:28,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:28,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:28,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1270055137, now seen corresponding path program 1 times [2018-11-28 18:17:28,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:28,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:28,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:28,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:28,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:28,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:17:28,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:17:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:17:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:17:28,441 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 6 states. [2018-11-28 18:17:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:28,935 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2018-11-28 18:17:28,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:17:28,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-28 18:17:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:28,937 INFO L225 Difference]: With dead ends: 158 [2018-11-28 18:17:28,937 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 18:17:28,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:17:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 18:17:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2018-11-28 18:17:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 18:17:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-11-28 18:17:28,948 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 33 [2018-11-28 18:17:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:28,948 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-28 18:17:28,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:17:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2018-11-28 18:17:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:17:28,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:28,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:28,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:28,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1030767453, now seen corresponding path program 1 times [2018-11-28 18:17:28,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:28,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:28,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:29,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:29,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:17:29,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:17:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:17:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:17:29,100 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 5 states. [2018-11-28 18:17:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:29,651 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2018-11-28 18:17:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:17:29,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-28 18:17:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:29,655 INFO L225 Difference]: With dead ends: 136 [2018-11-28 18:17:29,655 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 18:17:29,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:17:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 18:17:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2018-11-28 18:17:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 18:17:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-28 18:17:29,664 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 33 [2018-11-28 18:17:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:29,665 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-28 18:17:29,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:17:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-28 18:17:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 18:17:29,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:29,667 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:29,667 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:29,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash 292691762, now seen corresponding path program 1 times [2018-11-28 18:17:29,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:29,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:29,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:29,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:29,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:30,020 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 18:17:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:17:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:30,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:17:30,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:17:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:17:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:17:30,106 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 7 states. [2018-11-28 18:17:30,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:30,454 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2018-11-28 18:17:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:17:30,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-28 18:17:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:30,458 INFO L225 Difference]: With dead ends: 162 [2018-11-28 18:17:30,458 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 18:17:30,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:17:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 18:17:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2018-11-28 18:17:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 18:17:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2018-11-28 18:17:30,477 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 38 [2018-11-28 18:17:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:30,478 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2018-11-28 18:17:30,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:17:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2018-11-28 18:17:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 18:17:30,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:30,480 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:30,480 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:30,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:30,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1701452944, now seen corresponding path program 1 times [2018-11-28 18:17:30,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:30,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:17:30,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:30,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:17:30,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:17:30,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:17:30,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:17:30,619 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 7 states. [2018-11-28 18:17:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:31,312 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2018-11-28 18:17:31,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:17:31,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-28 18:17:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:31,314 INFO L225 Difference]: With dead ends: 113 [2018-11-28 18:17:31,314 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 18:17:31,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:17:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 18:17:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-11-28 18:17:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 18:17:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2018-11-28 18:17:31,338 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 38 [2018-11-28 18:17:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:31,344 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2018-11-28 18:17:31,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:17:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-28 18:17:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:17:31,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:31,349 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:31,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:31,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash -442357683, now seen corresponding path program 1 times [2018-11-28 18:17:31,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:31,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:31,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:17:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:31,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:17:31,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:17:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:17:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:17:31,512 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 4 states. [2018-11-28 18:17:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:31,824 INFO L93 Difference]: Finished difference Result 162 states and 208 transitions. [2018-11-28 18:17:31,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:17:31,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-28 18:17:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:31,828 INFO L225 Difference]: With dead ends: 162 [2018-11-28 18:17:31,829 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 18:17:31,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:17:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 18:17:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-28 18:17:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 18:17:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 136 transitions. [2018-11-28 18:17:31,859 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 136 transitions. Word has length 40 [2018-11-28 18:17:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:31,862 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 136 transitions. [2018-11-28 18:17:31,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:17:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 136 transitions. [2018-11-28 18:17:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:17:31,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:31,864 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:31,864 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:31,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1463426037, now seen corresponding path program 1 times [2018-11-28 18:17:31,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:31,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:31,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:31,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:32,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:32,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:17:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:32,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:32,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:32,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 18:17:32,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:17:32,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:17:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:17:32,334 INFO L87 Difference]: Start difference. First operand 108 states and 136 transitions. Second operand 8 states. [2018-11-28 18:17:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:32,863 INFO L93 Difference]: Finished difference Result 227 states and 287 transitions. [2018-11-28 18:17:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:17:32,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-28 18:17:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:32,865 INFO L225 Difference]: With dead ends: 227 [2018-11-28 18:17:32,865 INFO L226 Difference]: Without dead ends: 139 [2018-11-28 18:17:32,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:17:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-28 18:17:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-11-28 18:17:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 18:17:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-11-28 18:17:32,888 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 40 [2018-11-28 18:17:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:32,888 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-11-28 18:17:32,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:17:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-11-28 18:17:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 18:17:32,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:32,895 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:32,895 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:32,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:32,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1715300200, now seen corresponding path program 2 times [2018-11-28 18:17:32,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:32,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:32,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:33,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:33,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:17:33,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:17:33,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:17:33,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:17:33,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:34,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-28 18:17:34,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:17:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:17:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:17:34,012 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 16 states. [2018-11-28 18:17:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:34,698 INFO L93 Difference]: Finished difference Result 241 states and 301 transitions. [2018-11-28 18:17:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:17:34,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-11-28 18:17:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:34,701 INFO L225 Difference]: With dead ends: 241 [2018-11-28 18:17:34,702 INFO L226 Difference]: Without dead ends: 186 [2018-11-28 18:17:34,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-11-28 18:17:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-28 18:17:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2018-11-28 18:17:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-28 18:17:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2018-11-28 18:17:34,713 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 45 [2018-11-28 18:17:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:34,714 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2018-11-28 18:17:34,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:17:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2018-11-28 18:17:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 18:17:34,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:34,715 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:34,715 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:34,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1014235622, now seen corresponding path program 1 times [2018-11-28 18:17:34,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:34,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:34,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:17:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:34,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:34,840 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 [2018-11-28 18:17:34,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:34,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:35,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:35,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-28 18:17:35,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:17:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:17:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:17:35,097 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand 16 states. [2018-11-28 18:17:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:35,722 INFO L93 Difference]: Finished difference Result 195 states and 237 transitions. [2018-11-28 18:17:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:17:35,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-11-28 18:17:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:35,725 INFO L225 Difference]: With dead ends: 195 [2018-11-28 18:17:35,725 INFO L226 Difference]: Without dead ends: 193 [2018-11-28 18:17:35,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:17:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-28 18:17:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 133. [2018-11-28 18:17:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-28 18:17:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2018-11-28 18:17:35,738 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 45 [2018-11-28 18:17:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:35,738 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2018-11-28 18:17:35,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:17:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2018-11-28 18:17:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 18:17:35,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:35,741 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:35,742 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:35,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1762018646, now seen corresponding path program 1 times [2018-11-28 18:17:35,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:35,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:35,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:35,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:35,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:35,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:35,901 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 [2018-11-28 18:17:35,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:35,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-28 18:17:36,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:17:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:17:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:17:36,339 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand 16 states. [2018-11-28 18:17:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:36,886 INFO L93 Difference]: Finished difference Result 217 states and 268 transitions. [2018-11-28 18:17:36,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 18:17:36,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-11-28 18:17:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:36,891 INFO L225 Difference]: With dead ends: 217 [2018-11-28 18:17:36,891 INFO L226 Difference]: Without dead ends: 215 [2018-11-28 18:17:36,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2018-11-28 18:17:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-28 18:17:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 152. [2018-11-28 18:17:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 18:17:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 193 transitions. [2018-11-28 18:17:36,907 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 193 transitions. Word has length 45 [2018-11-28 18:17:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:36,909 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 193 transitions. [2018-11-28 18:17:36,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:17:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 193 transitions. [2018-11-28 18:17:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 18:17:36,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:36,910 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:36,912 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:36,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1831884072, now seen corresponding path program 1 times [2018-11-28 18:17:36,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:36,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:36,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:17:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:17:36,969 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:17:37,008 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,013 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,016 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,019 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,020 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,020 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,021 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,021 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,022 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,028 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,029 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:17:37 BoogieIcfgContainer [2018-11-28 18:17:37,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:17:37,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:17:37,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:17:37,051 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:17:37,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:27" (3/4) ... [2018-11-28 18:17:37,056 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:17:37,075 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,075 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,076 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,076 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,077 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,077 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,077 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,078 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,078 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,078 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,079 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-28 18:17:37,156 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:17:37,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:17:37,158 INFO L168 Benchmark]: Toolchain (without parser) took 11256.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 952.7 MB in the beginning and 927.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 229.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:37,159 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:17:37,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:37,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:37,162 INFO L168 Benchmark]: Boogie Preprocessor took 134.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:37,163 INFO L168 Benchmark]: RCFGBuilder took 716.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:37,164 INFO L168 Benchmark]: TraceAbstraction took 9820.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 935.1 MB in the end (delta: 161.7 MB). Peak memory consumption was 231.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:37,165 INFO L168 Benchmark]: Witness Printer took 106.45 ms. Allocated memory is still 1.2 GB. Free memory was 935.1 MB in the beginning and 927.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:37,169 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.18 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 436.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 716.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9820.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 935.1 MB in the end (delta: 161.7 MB). Peak memory consumption was 231.4 MB. Max. memory is 11.5 GB. * Witness Printer took 106.45 ms. Allocated memory is still 1.2 GB. Free memory was 935.1 MB in the beginning and 927.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] char A [2 + 2 + 4 +1]; [L75] A[2 + 2 + 4] = 0 VAL [A={40:0}] [L76] CALL parse_expression_list (A) VAL [str={40:0}] [L48] int start=0, i=-1, j=-1; [L49] char str2[2]; VAL [i=-1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}] [L50] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}] [L52] i++ [L53] str[i] [L54] case 0: VAL [i=0, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] EXPR str[i] VAL [i=0, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] EXPR str[i] VAL [i=1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=2, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[start]=1, str[start]=1] [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L56] EXPR str[start] VAL [i=2, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[start]=1] [L56] COND FALSE !(str[start] == '"') [L57] j = i-1 VAL [i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[j]=1, str[j]=1] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[j]=1, str[j]=1] [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L59] (0 < j) && (str[j] == '"') [L59] EXPR str[j] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[j]=1] [L59] COND FALSE !((0 < j) && (str[j] == '"')) [L60] COND TRUE start<=j VAL [i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L61] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={38:0}, src={40:0}] [L30] return strncpy(dest,src,n); [L61] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={35:37}, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L62] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. UNSAFE Result, 9.7s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 620 SDtfs, 1131 SDslu, 2008 SDs, 0 SdLazy, 1410 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=12, 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, 12 MinimizatonAttempts, 319 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 84723 SizeOfPredicates, 11 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 6/64 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...