./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe027_tso.opt_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe027_tso.opt_true-unreach-call.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 cf7a1bd5a0da233b6f98d9da1a1f0c5498624db7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 05:51:07,170 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:51:07,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:51:07,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:51:07,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:51:07,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:51:07,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:51:07,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:51:07,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:51:07,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:51:07,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:51:07,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:51:07,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:51:07,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:51:07,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:51:07,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:51:07,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:51:07,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:51:07,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:51:07,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:51:07,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:51:07,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:51:07,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:51:07,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:51:07,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:51:07,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:51:07,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:51:07,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:51:07,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:51:07,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:51:07,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:51:07,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:51:07,249 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:51:07,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:51:07,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:51:07,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:51:07,253 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:51:07,282 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:51:07,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:51:07,284 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:51:07,284 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:51:07,284 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:51:07,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:51:07,285 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:51:07,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:51:07,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:51:07,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:51:07,285 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:51:07,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:51:07,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:51:07,287 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:51:07,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:51:07,287 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:51:07,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:51:07,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:51:07,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:51:07,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:51:07,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:51:07,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:51:07,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:51:07,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:51:07,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:51:07,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:51:07,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:51:07,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:51:07,291 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 -> cf7a1bd5a0da233b6f98d9da1a1f0c5498624db7 [2019-01-13 05:51:07,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:51:07,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:51:07,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:51:07,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:51:07,353 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:51:07,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe027_tso.opt_true-unreach-call.i [2019-01-13 05:51:07,408 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00b7fc7e/afaad3939f1f4853b5bd5530248a0b9d/FLAG922253ef6 [2019-01-13 05:51:07,940 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:51:07,941 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe027_tso.opt_true-unreach-call.i [2019-01-13 05:51:07,954 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00b7fc7e/afaad3939f1f4853b5bd5530248a0b9d/FLAG922253ef6 [2019-01-13 05:51:08,215 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00b7fc7e/afaad3939f1f4853b5bd5530248a0b9d [2019-01-13 05:51:08,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:51:08,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:51:08,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:51:08,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:51:08,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:51:08,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc2c5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08, skipping insertion in model container [2019-01-13 05:51:08,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:51:08,282 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:51:08,743 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:51:08,761 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:51:08,882 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:51:08,982 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:51:08,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08 WrapperNode [2019-01-13 05:51:08,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:51:08,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:51:08,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:51:08,984 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:51:08,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:51:09,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:51:09,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:51:09,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:51:09,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:09,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:51:09,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:51:09,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:51:09,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:51:09,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:51:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:51:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:51:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:51:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:51:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:51:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:51:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:51:09,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:51:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 05:51:09,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 05:51:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-13 05:51:09,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-13 05:51:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:51:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:51:09,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:51:09,157 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:51:09,737 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:51:09,738 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-13 05:51:09,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:51:09 BoogieIcfgContainer [2019-01-13 05:51:09,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:51:09,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:51:09,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:51:09,743 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:51:09,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:51:08" (1/3) ... [2019-01-13 05:51:09,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7930f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:51:09, skipping insertion in model container [2019-01-13 05:51:09,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (2/3) ... [2019-01-13 05:51:09,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7930f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:51:09, skipping insertion in model container [2019-01-13 05:51:09,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:51:09" (3/3) ... [2019-01-13 05:51:09,747 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_tso.opt_true-unreach-call.i [2019-01-13 05:51:09,784 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,784 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,785 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,785 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,789 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,789 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,791 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,791 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,791 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,792 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,792 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,792 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,795 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,795 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,795 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,798 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,798 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,798 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,798 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,799 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,799 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,799 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,799 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,799 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,799 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,824 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:51:09,824 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:51:09,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-13 05:51:09,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-13 05:51:09,886 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:51:09,887 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:51:09,887 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:51:09,887 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:51:09,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:51:09,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:51:09,888 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:51:09,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:51:09,888 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:51:09,898 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68places, 64 transitions [2019-01-13 05:51:10,867 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13136 states. [2019-01-13 05:51:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 13136 states. [2019-01-13 05:51:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 05:51:10,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:10,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:10,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash -791038270, now seen corresponding path program 1 times [2019-01-13 05:51:10,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:10,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:11,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:51:11,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:51:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:51:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:51:11,304 INFO L87 Difference]: Start difference. First operand 13136 states. Second operand 4 states. [2019-01-13 05:51:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:11,913 INFO L93 Difference]: Finished difference Result 13742 states and 55793 transitions. [2019-01-13 05:51:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:51:11,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-13 05:51:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:12,019 INFO L225 Difference]: With dead ends: 13742 [2019-01-13 05:51:12,019 INFO L226 Difference]: Without dead ends: 5629 [2019-01-13 05:51:12,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:51:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5629 states. [2019-01-13 05:51:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5629 to 5629. [2019-01-13 05:51:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5629 states. [2019-01-13 05:51:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5629 states to 5629 states and 22352 transitions. [2019-01-13 05:51:12,426 INFO L78 Accepts]: Start accepts. Automaton has 5629 states and 22352 transitions. Word has length 35 [2019-01-13 05:51:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:12,429 INFO L480 AbstractCegarLoop]: Abstraction has 5629 states and 22352 transitions. [2019-01-13 05:51:12,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:51:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5629 states and 22352 transitions. [2019-01-13 05:51:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 05:51:12,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:12,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:12,440 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1324297606, now seen corresponding path program 1 times [2019-01-13 05:51:12,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:12,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:12,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:12,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:12,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:12,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:12,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:51:12,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:51:12,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:51:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:51:12,801 INFO L87 Difference]: Start difference. First operand 5629 states and 22352 transitions. Second operand 5 states. [2019-01-13 05:51:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:13,523 INFO L93 Difference]: Finished difference Result 6141 states and 23832 transitions. [2019-01-13 05:51:13,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:51:13,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-13 05:51:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:13,573 INFO L225 Difference]: With dead ends: 6141 [2019-01-13 05:51:13,573 INFO L226 Difference]: Without dead ends: 5517 [2019-01-13 05:51:13,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5517 states. [2019-01-13 05:51:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5517 to 5517. [2019-01-13 05:51:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5517 states. [2019-01-13 05:51:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 21820 transitions. [2019-01-13 05:51:13,803 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 21820 transitions. Word has length 36 [2019-01-13 05:51:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:13,804 INFO L480 AbstractCegarLoop]: Abstraction has 5517 states and 21820 transitions. [2019-01-13 05:51:13,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:51:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 21820 transitions. [2019-01-13 05:51:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 05:51:13,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:13,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:13,814 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:13,814 INFO L82 PathProgramCache]: Analyzing trace with hash -999628882, now seen corresponding path program 1 times [2019-01-13 05:51:13,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:13,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:13,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:14,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:14,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:51:14,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:51:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:51:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:51:14,182 INFO L87 Difference]: Start difference. First operand 5517 states and 21820 transitions. Second operand 6 states. [2019-01-13 05:51:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:14,697 INFO L93 Difference]: Finished difference Result 5453 states and 20828 transitions. [2019-01-13 05:51:14,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:14,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-13 05:51:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:14,740 INFO L225 Difference]: With dead ends: 5453 [2019-01-13 05:51:14,740 INFO L226 Difference]: Without dead ends: 4845 [2019-01-13 05:51:14,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:51:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2019-01-13 05:51:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4845. [2019-01-13 05:51:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2019-01-13 05:51:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 18796 transitions. [2019-01-13 05:51:14,897 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 18796 transitions. Word has length 37 [2019-01-13 05:51:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:14,898 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 18796 transitions. [2019-01-13 05:51:14,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:51:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 18796 transitions. [2019-01-13 05:51:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 05:51:14,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:14,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:14,907 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1893784710, now seen corresponding path program 1 times [2019-01-13 05:51:14,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:14,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:14,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:14,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:14,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:15,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:15,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:15,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:15,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:15,091 INFO L87 Difference]: Start difference. First operand 4845 states and 18796 transitions. Second operand 7 states. [2019-01-13 05:51:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:15,625 INFO L93 Difference]: Finished difference Result 3565 states and 13036 transitions. [2019-01-13 05:51:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:51:15,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-01-13 05:51:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:15,662 INFO L225 Difference]: With dead ends: 3565 [2019-01-13 05:51:15,663 INFO L226 Difference]: Without dead ends: 3053 [2019-01-13 05:51:15,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2019-01-13 05:51:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3053. [2019-01-13 05:51:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-01-13 05:51:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 11180 transitions. [2019-01-13 05:51:15,799 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 11180 transitions. Word has length 38 [2019-01-13 05:51:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:15,800 INFO L480 AbstractCegarLoop]: Abstraction has 3053 states and 11180 transitions. [2019-01-13 05:51:15,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 11180 transitions. [2019-01-13 05:51:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:15,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:15,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:15,809 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1572457708, now seen corresponding path program 1 times [2019-01-13 05:51:15,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:15,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:15,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:16,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:16,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:16,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:16,075 INFO L87 Difference]: Start difference. First operand 3053 states and 11180 transitions. Second operand 7 states. [2019-01-13 05:51:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:16,320 INFO L93 Difference]: Finished difference Result 4733 states and 17540 transitions. [2019-01-13 05:51:16,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:16,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:16,333 INFO L225 Difference]: With dead ends: 4733 [2019-01-13 05:51:16,333 INFO L226 Difference]: Without dead ends: 2457 [2019-01-13 05:51:16,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2019-01-13 05:51:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2019-01-13 05:51:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-01-13 05:51:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 9124 transitions. [2019-01-13 05:51:16,479 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 9124 transitions. Word has length 39 [2019-01-13 05:51:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:16,480 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 9124 transitions. [2019-01-13 05:51:16,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 9124 transitions. [2019-01-13 05:51:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:16,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:16,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:16,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash 540968834, now seen corresponding path program 2 times [2019-01-13 05:51:16,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:16,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:16,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:16,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:16,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:16,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:16,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:16,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:16,671 INFO L87 Difference]: Start difference. First operand 2457 states and 9124 transitions. Second operand 7 states. [2019-01-13 05:51:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:16,870 INFO L93 Difference]: Finished difference Result 4057 states and 15220 transitions. [2019-01-13 05:51:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:16,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:16,882 INFO L225 Difference]: With dead ends: 4057 [2019-01-13 05:51:16,882 INFO L226 Difference]: Without dead ends: 2261 [2019-01-13 05:51:16,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-01-13 05:51:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2019-01-13 05:51:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-01-13 05:51:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 8528 transitions. [2019-01-13 05:51:16,948 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 8528 transitions. Word has length 39 [2019-01-13 05:51:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:16,948 INFO L480 AbstractCegarLoop]: Abstraction has 2261 states and 8528 transitions. [2019-01-13 05:51:16,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 8528 transitions. [2019-01-13 05:51:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:16,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:16,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:16,953 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1549190684, now seen corresponding path program 3 times [2019-01-13 05:51:16,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:16,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:16,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:16,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:51:16,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:17,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:17,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:17,123 INFO L87 Difference]: Start difference. First operand 2261 states and 8528 transitions. Second operand 7 states. [2019-01-13 05:51:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:17,272 INFO L93 Difference]: Finished difference Result 3797 states and 14416 transitions. [2019-01-13 05:51:17,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:17,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:17,284 INFO L225 Difference]: With dead ends: 3797 [2019-01-13 05:51:17,284 INFO L226 Difference]: Without dead ends: 2161 [2019-01-13 05:51:17,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2019-01-13 05:51:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2019-01-13 05:51:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2019-01-13 05:51:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 8220 transitions. [2019-01-13 05:51:17,346 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 8220 transitions. Word has length 39 [2019-01-13 05:51:17,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:17,347 INFO L480 AbstractCegarLoop]: Abstraction has 2161 states and 8220 transitions. [2019-01-13 05:51:17,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 8220 transitions. [2019-01-13 05:51:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:17,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:17,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:51:17,351 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash -481726390, now seen corresponding path program 4 times [2019-01-13 05:51:17,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:17,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:17,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:51:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:51:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:17,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:17,581 INFO L87 Difference]: Start difference. First operand 2161 states and 8220 transitions. Second operand 7 states. [2019-01-13 05:51:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:17,720 INFO L93 Difference]: Finished difference Result 1649 states and 6172 transitions. [2019-01-13 05:51:17,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:17,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:17,721 INFO L225 Difference]: With dead ends: 1649 [2019-01-13 05:51:17,721 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 05:51:17,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 05:51:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 05:51:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 05:51:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 05:51:17,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-01-13 05:51:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:17,722 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 05:51:17,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 05:51:17,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 05:51:17,725 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:51:17,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:51:17 BasicIcfg [2019-01-13 05:51:17,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:51:17,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:51:17,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:51:17,728 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:51:17,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:51:09" (3/4) ... [2019-01-13 05:51:17,732 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 05:51:17,738 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-13 05:51:17,738 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-13 05:51:17,738 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-13 05:51:17,738 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-13 05:51:17,743 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 05:51:17,743 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 05:51:17,791 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:51:17,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:51:17,792 INFO L168 Benchmark]: Toolchain (without parser) took 9573.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -119.8 MB). Peak memory consumption was 220.4 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,794 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:51:17,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,796 INFO L168 Benchmark]: Boogie Preprocessor took 31.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:51:17,796 INFO L168 Benchmark]: RCFGBuilder took 660.15 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,797 INFO L168 Benchmark]: TraceAbstraction took 7987.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,798 INFO L168 Benchmark]: Witness Printer took 63.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:51:17,802 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 763.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 660.15 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7987.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. * Witness Printer took 63.47 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 88 locations, 1 error locations. SAFE Result, 7.8s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 560 SDtfs, 855 SDslu, 1528 SDs, 0 SdLazy, 188 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13136occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 27742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...