./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/thin002_tso.oepc_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/thin002_tso.oepc_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 0a986b08dd7a1d9de684ac66adc6b4db3c2e0701 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:52:23,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:52:23,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:52:23,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:52:23,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:52:23,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:52:23,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:52:23,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:52:23,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:52:23,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:52:23,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:52:23,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:52:23,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:52:23,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:52:23,163 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:52:23,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:52:23,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:52:23,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:52:23,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:52:23,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:52:23,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:52:23,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:52:23,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:52:23,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:52:23,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:52:23,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:52:23,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:52:23,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:52:23,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:52:23,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:52:23,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:52:23,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:52:23,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:52:23,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:52:23,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:52:23,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:52:23,207 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:52:23,235 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:52:23,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:52:23,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:52:23,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:52:23,237 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:52:23,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:52:23,238 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:52:23,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:52:23,238 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:52:23,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:52:23,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:52:23,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:52:23,239 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:52:23,239 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:52:23,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:52:23,239 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:52:23,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:52:23,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:52:23,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:52:23,240 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:52:23,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:52:23,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:52:23,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:52:23,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:52:23,241 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:52:23,241 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:52:23,241 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:52:23,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:52:23,241 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 -> 0a986b08dd7a1d9de684ac66adc6b4db3c2e0701 [2019-01-13 05:52:23,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:52:23,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:52:23,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:52:23,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:52:23,318 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:52:23,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/thin002_tso.oepc_true-unreach-call.i [2019-01-13 05:52:23,383 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a59a80a1/749ad754637c4715abcaedc2835e80db/FLAG158214e93 [2019-01-13 05:52:23,916 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:52:23,916 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/thin002_tso.oepc_true-unreach-call.i [2019-01-13 05:52:23,937 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a59a80a1/749ad754637c4715abcaedc2835e80db/FLAG158214e93 [2019-01-13 05:52:24,220 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a59a80a1/749ad754637c4715abcaedc2835e80db [2019-01-13 05:52:24,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:52:24,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:52:24,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:52:24,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:52:24,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:52:24,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:24,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2907c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24, skipping insertion in model container [2019-01-13 05:52:24,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:24,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:52:24,302 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:52:24,670 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:52:24,688 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:52:24,831 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:52:24,924 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:52:24,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24 WrapperNode [2019-01-13 05:52:24,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:52:24,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:52:24,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:52:24,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:52:24,936 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:52:24" (1/1) ... [2019-01-13 05:52:24,957 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:52:24" (1/1) ... [2019-01-13 05:52:24,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:52:24,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:52:24,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:52:24,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:52:24,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:24,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:24,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:24,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:25,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:25,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:25,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:25,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:52:25,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:52:25,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:52:25,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:52:25,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (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:52:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:52:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:52:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:52:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:52:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:52:25,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:52:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:52:25,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:52:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 05:52:25,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 05:52:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-13 05:52:25,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-13 05:52:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:52:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:52:25,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:52:25,080 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:52:25,617 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:52:25,617 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-13 05:52:25,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:52:25 BoogieIcfgContainer [2019-01-13 05:52:25,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:52:25,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:52:25,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:52:25,623 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:52:25,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:52:24" (1/3) ... [2019-01-13 05:52:25,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc0bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:52:25, skipping insertion in model container [2019-01-13 05:52:25,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24" (2/3) ... [2019-01-13 05:52:25,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc0bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:52:25, skipping insertion in model container [2019-01-13 05:52:25,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:52:25" (3/3) ... [2019-01-13 05:52:25,627 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_tso.oepc_true-unreach-call.i [2019-01-13 05:52:25,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,664 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,665 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,666 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,666 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,666 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,667 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,667 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,669 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,669 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,669 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,669 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,670 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,670 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,670 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,670 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,671 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,671 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,671 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,671 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,671 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,672 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,672 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,672 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,672 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,672 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,672 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,673 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:25,693 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:52:25,693 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:52:25,702 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-13 05:52:25,719 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-13 05:52:25,745 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:52:25,746 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:52:25,746 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:52:25,746 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:52:25,746 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:52:25,746 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:52:25,746 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:52:25,747 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:52:25,747 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:52:25,755 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70places, 66 transitions [2019-01-13 05:52:26,952 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13138 states. [2019-01-13 05:52:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states. [2019-01-13 05:52:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 05:52:26,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:26,993 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:52:26,996 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1445141644, now seen corresponding path program 1 times [2019-01-13 05:52:27,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:27,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:27,351 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:52:27,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:52:27,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:52:27,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:52:27,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:52:27,382 INFO L87 Difference]: Start difference. First operand 13138 states. Second operand 4 states. [2019-01-13 05:52:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:28,021 INFO L93 Difference]: Finished difference Result 13744 states and 55795 transitions. [2019-01-13 05:52:28,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:52:28,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 05:52:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:28,117 INFO L225 Difference]: With dead ends: 13744 [2019-01-13 05:52:28,118 INFO L226 Difference]: Without dead ends: 5631 [2019-01-13 05:52:28,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:52:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-01-13 05:52:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5631. [2019-01-13 05:52:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5631 states. [2019-01-13 05:52:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5631 states to 5631 states and 22354 transitions. [2019-01-13 05:52:28,454 INFO L78 Accepts]: Start accepts. Automaton has 5631 states and 22354 transitions. Word has length 37 [2019-01-13 05:52:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:28,457 INFO L480 AbstractCegarLoop]: Abstraction has 5631 states and 22354 transitions. [2019-01-13 05:52:28,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:52:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5631 states and 22354 transitions. [2019-01-13 05:52:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 05:52:28,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:28,468 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:52:28,469 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1883999228, now seen corresponding path program 1 times [2019-01-13 05:52:28,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:28,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:28,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:28,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:28,787 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:52:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:52:28,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:52:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:52:28,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:52:28,792 INFO L87 Difference]: Start difference. First operand 5631 states and 22354 transitions. Second operand 5 states. [2019-01-13 05:52:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:29,566 INFO L93 Difference]: Finished difference Result 6143 states and 23834 transitions. [2019-01-13 05:52:29,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:52:29,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-01-13 05:52:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:29,619 INFO L225 Difference]: With dead ends: 6143 [2019-01-13 05:52:29,619 INFO L226 Difference]: Without dead ends: 5519 [2019-01-13 05:52:29,620 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:52:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2019-01-13 05:52:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5519. [2019-01-13 05:52:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2019-01-13 05:52:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 21822 transitions. [2019-01-13 05:52:29,890 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 21822 transitions. Word has length 38 [2019-01-13 05:52:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:29,891 INFO L480 AbstractCegarLoop]: Abstraction has 5519 states and 21822 transitions. [2019-01-13 05:52:29,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:52:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 21822 transitions. [2019-01-13 05:52:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:52:29,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:29,902 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:52:29,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:29,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:29,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1586589234, now seen corresponding path program 1 times [2019-01-13 05:52:29,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:29,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:29,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:29,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:30,342 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:52:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:52:30,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:52:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:52:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:52:30,345 INFO L87 Difference]: Start difference. First operand 5519 states and 21822 transitions. Second operand 6 states. [2019-01-13 05:52:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:31,281 INFO L93 Difference]: Finished difference Result 5455 states and 20830 transitions. [2019-01-13 05:52:31,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:52:31,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-13 05:52:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:31,326 INFO L225 Difference]: With dead ends: 5455 [2019-01-13 05:52:31,326 INFO L226 Difference]: Without dead ends: 4847 [2019-01-13 05:52:31,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:52:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2019-01-13 05:52:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4847. [2019-01-13 05:52:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2019-01-13 05:52:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 18798 transitions. [2019-01-13 05:52:31,503 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 18798 transitions. Word has length 39 [2019-01-13 05:52:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:31,503 INFO L480 AbstractCegarLoop]: Abstraction has 4847 states and 18798 transitions. [2019-01-13 05:52:31,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:52:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 18798 transitions. [2019-01-13 05:52:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 05:52:31,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:31,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:31,516 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2117960818, now seen corresponding path program 1 times [2019-01-13 05:52:31,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:31,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:31,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:31,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:31,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:31,726 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:52:31,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:31,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:52:31,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:52:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:52:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:52:31,728 INFO L87 Difference]: Start difference. First operand 4847 states and 18798 transitions. Second operand 7 states. [2019-01-13 05:52:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:32,404 INFO L93 Difference]: Finished difference Result 3567 states and 13038 transitions. [2019-01-13 05:52:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:52:32,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-01-13 05:52:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:32,428 INFO L225 Difference]: With dead ends: 3567 [2019-01-13 05:52:32,428 INFO L226 Difference]: Without dead ends: 3055 [2019-01-13 05:52:32,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:52:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-01-13 05:52:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3055. [2019-01-13 05:52:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2019-01-13 05:52:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 11182 transitions. [2019-01-13 05:52:32,574 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 11182 transitions. Word has length 40 [2019-01-13 05:52:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:32,574 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 11182 transitions. [2019-01-13 05:52:32,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:52:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 11182 transitions. [2019-01-13 05:52:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:32,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:32,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:32,586 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2066804268, now seen corresponding path program 1 times [2019-01-13 05:52:32,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:32,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:32,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:32,828 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:52:32,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:32,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:52:32,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:52:32,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:52:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:52:32,923 INFO L87 Difference]: Start difference. First operand 3055 states and 11182 transitions. Second operand 7 states. [2019-01-13 05:52:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:33,173 INFO L93 Difference]: Finished difference Result 4735 states and 17542 transitions. [2019-01-13 05:52:33,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:52:33,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-13 05:52:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:33,188 INFO L225 Difference]: With dead ends: 4735 [2019-01-13 05:52:33,188 INFO L226 Difference]: Without dead ends: 2459 [2019-01-13 05:52:33,188 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:52:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-01-13 05:52:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2459. [2019-01-13 05:52:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-01-13 05:52:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 9126 transitions. [2019-01-13 05:52:33,261 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 9126 transitions. Word has length 41 [2019-01-13 05:52:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:33,262 INFO L480 AbstractCegarLoop]: Abstraction has 2459 states and 9126 transitions. [2019-01-13 05:52:33,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:52:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 9126 transitions. [2019-01-13 05:52:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:33,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:33,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:33,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1267331510, now seen corresponding path program 2 times [2019-01-13 05:52:33,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:33,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:33,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:33,804 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:52:33,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:33,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:52:33,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:52:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:52:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:52:33,807 INFO L87 Difference]: Start difference. First operand 2459 states and 9126 transitions. Second operand 12 states. [2019-01-13 05:52:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:34,188 INFO L93 Difference]: Finished difference Result 4219 states and 15686 transitions. [2019-01-13 05:52:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:52:34,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-13 05:52:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:34,199 INFO L225 Difference]: With dead ends: 4219 [2019-01-13 05:52:34,200 INFO L226 Difference]: Without dead ends: 2423 [2019-01-13 05:52:34,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-13 05:52:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-01-13 05:52:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-01-13 05:52:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-01-13 05:52:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 9034 transitions. [2019-01-13 05:52:34,277 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 9034 transitions. Word has length 41 [2019-01-13 05:52:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:34,277 INFO L480 AbstractCegarLoop]: Abstraction has 2423 states and 9034 transitions. [2019-01-13 05:52:34,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:52:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 9034 transitions. [2019-01-13 05:52:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:34,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:34,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:34,281 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash -947505724, now seen corresponding path program 3 times [2019-01-13 05:52:34,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:34,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:34,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:52:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:34,657 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-13 05:52:34,803 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:52:34,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:34,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:52:34,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:52:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:52:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:52:34,805 INFO L87 Difference]: Start difference. First operand 2423 states and 9034 transitions. Second operand 12 states. [2019-01-13 05:52:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:35,088 INFO L93 Difference]: Finished difference Result 4087 states and 15338 transitions. [2019-01-13 05:52:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:52:35,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-13 05:52:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:35,103 INFO L225 Difference]: With dead ends: 4087 [2019-01-13 05:52:35,103 INFO L226 Difference]: Without dead ends: 2327 [2019-01-13 05:52:35,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-01-13 05:52:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-01-13 05:52:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2327. [2019-01-13 05:52:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2019-01-13 05:52:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 8754 transitions. [2019-01-13 05:52:35,171 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 8754 transitions. Word has length 41 [2019-01-13 05:52:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:35,172 INFO L480 AbstractCegarLoop]: Abstraction has 2327 states and 8754 transitions. [2019-01-13 05:52:35,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:52:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 8754 transitions. [2019-01-13 05:52:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:35,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:35,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:35,176 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:35,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1706270886, now seen corresponding path program 4 times [2019-01-13 05:52:35,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:35,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:35,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:35,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:52:35,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:35,422 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:52:35,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:35,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:52:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:52:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:52:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:52:35,424 INFO L87 Difference]: Start difference. First operand 2327 states and 8754 transitions. Second operand 12 states. [2019-01-13 05:52:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:35,685 INFO L93 Difference]: Finished difference Result 4007 states and 15114 transitions. [2019-01-13 05:52:35,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:52:35,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-13 05:52:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:35,696 INFO L225 Difference]: With dead ends: 4007 [2019-01-13 05:52:35,696 INFO L226 Difference]: Without dead ends: 2307 [2019-01-13 05:52:35,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-13 05:52:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-01-13 05:52:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-01-13 05:52:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-01-13 05:52:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 8714 transitions. [2019-01-13 05:52:35,760 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 8714 transitions. Word has length 41 [2019-01-13 05:52:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:35,760 INFO L480 AbstractCegarLoop]: Abstraction has 2307 states and 8714 transitions. [2019-01-13 05:52:35,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:52:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 8714 transitions. [2019-01-13 05:52:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:35,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:35,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:35,764 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:35,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1979481092, now seen corresponding path program 5 times [2019-01-13 05:52:35,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:35,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:35,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:52:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:35,966 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:52:35,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:35,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:52:35,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:52:35,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:52:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:52:35,969 INFO L87 Difference]: Start difference. First operand 2307 states and 8714 transitions. Second operand 7 states. [2019-01-13 05:52:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:36,048 INFO L93 Difference]: Finished difference Result 1795 states and 6666 transitions. [2019-01-13 05:52:36,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:52:36,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-13 05:52:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:36,049 INFO L225 Difference]: With dead ends: 1795 [2019-01-13 05:52:36,049 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 05:52:36,049 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:52:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 05:52:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 05:52:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 05:52:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 05:52:36,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-13 05:52:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:36,050 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 05:52:36,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:52:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 05:52:36,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 05:52:36,054 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:52:36,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:52:36 BasicIcfg [2019-01-13 05:52:36,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:52:36,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:52:36,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:52:36,056 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:52:36,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:52:25" (3/4) ... [2019-01-13 05:52:36,061 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 05:52:36,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-13 05:52:36,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-13 05:52:36,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-13 05:52:36,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-13 05:52:36,075 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 05:52:36,075 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 05:52:36,137 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:52:36,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:52:36,138 INFO L168 Benchmark]: Toolchain (without parser) took 11913.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 948.7 MB in the beginning and 854.9 MB in the end (delta: 93.8 MB). Peak memory consumption was 425.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:36,139 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:52:36,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:36,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.86 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:52:36,141 INFO L168 Benchmark]: Boogie Preprocessor took 33.23 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:52:36,142 INFO L168 Benchmark]: RCFGBuilder took 604.20 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:52:36,142 INFO L168 Benchmark]: TraceAbstraction took 10435.91 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 854.9 MB in the end (delta: 222.2 MB). Peak memory consumption was 414.1 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:36,143 INFO L168 Benchmark]: Witness Printer took 81.33 ms. Allocated memory is still 1.4 GB. Free memory was 854.9 MB in the beginning and 854.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 05:52:36,153 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 698.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.86 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 33.23 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 604.20 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 10435.91 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 854.9 MB in the end (delta: 222.2 MB). Peak memory consumption was 414.1 MB. Max. memory is 11.5 GB. * Witness Printer took 81.33 ms. Allocated memory is still 1.4 GB. Free memory was 854.9 MB in the beginning and 854.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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, 90 locations, 1 error locations. SAFE Result, 10.3s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 735 SDtfs, 1159 SDslu, 3579 SDs, 0 SdLazy, 541 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13138occurred 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 54990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...