./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread/triangular_false-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/triangular_false-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 440b8f87b993409470c921154676895cb2b74b47 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 22:20:23,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:20:23,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:20:23,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:20:23,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:20:23,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:20:23,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:20:23,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:20:23,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:20:23,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:20:23,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:20:23,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:20:23,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:20:23,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:20:23,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:20:23,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:20:23,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:20:23,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:20:23,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:20:23,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:20:23,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:20:23,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:20:23,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:20:23,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:20:23,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:20:23,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:20:23,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:20:23,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:20:23,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:20:23,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:20:23,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:20:23,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:20:23,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:20:23,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:20:23,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:20:23,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:20:23,338 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 22:20:23,357 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:20:23,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:20:23,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:20:23,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:20:23,360 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:20:23,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:20:23,361 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:20:23,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:20:23,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:20:23,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:20:23,362 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:20:23,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:20:23,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:20:23,362 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:20:23,362 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:20:23,363 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:20:23,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:20:23,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:20:23,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:20:23,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:20:23,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:20:23,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:20:23,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:20:23,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:20:23,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:20:23,366 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:20:23,367 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:20:23,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:20:23,367 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 -> 440b8f87b993409470c921154676895cb2b74b47 [2019-01-12 22:20:23,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:20:23,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:20:23,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:20:23,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:20:23,462 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:20:23,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/triangular_false-unreach-call.i [2019-01-12 22:20:23,527 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67b71532/10ddbf84acae40419c87172dcd8ad66e/FLAG41c2f6acb [2019-01-12 22:20:24,041 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:20:24,042 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/triangular_false-unreach-call.i [2019-01-12 22:20:24,055 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67b71532/10ddbf84acae40419c87172dcd8ad66e/FLAG41c2f6acb [2019-01-12 22:20:24,330 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67b71532/10ddbf84acae40419c87172dcd8ad66e [2019-01-12 22:20:24,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:20:24,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:20:24,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:20:24,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:20:24,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:20:24,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:20:24" (1/1) ... [2019-01-12 22:20:24,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637452b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:24, skipping insertion in model container [2019-01-12 22:20:24,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:20:24" (1/1) ... [2019-01-12 22:20:24,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:20:24,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:20:24,791 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:20:24,803 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:20:24,943 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:20:25,018 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:20:25,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25 WrapperNode [2019-01-12 22:20:25,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:20:25,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:20:25,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:20:25,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:20:25,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:20:25,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:20:25,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:20:25,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:20:25,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... [2019-01-12 22:20:25,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:20:25,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:20:25,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:20:25,121 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:20:25,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:20:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-01-12 22:20:25,173 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-01-12 22:20:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-01-12 22:20:25,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-01-12 22:20:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:20:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 22:20:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:20:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:20:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 22:20:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:20:25,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:20:25,177 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 22:20:25,650 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:20:25,651 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-12 22:20:25,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:20:25 BoogieIcfgContainer [2019-01-12 22:20:25,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:20:25,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:20:25,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:20:25,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:20:25,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:20:24" (1/3) ... [2019-01-12 22:20:25,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4409c76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:20:25, skipping insertion in model container [2019-01-12 22:20:25,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:20:25" (2/3) ... [2019-01-12 22:20:25,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4409c76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:20:25, skipping insertion in model container [2019-01-12 22:20:25,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:20:25" (3/3) ... [2019-01-12 22:20:25,660 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular_false-unreach-call.i [2019-01-12 22:20:25,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,691 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,691 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,692 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,692 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,692 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,694 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,695 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,695 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,695 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,696 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,696 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,696 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,697 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:20:25,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:20:25,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:20:25,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 22:20:25,731 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 22:20:25,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:20:25,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:20:25,759 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:20:25,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:20:25,759 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:20:25,759 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:20:25,759 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:20:25,759 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:20:25,760 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:20:25,769 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46places, 48 transitions [2019-01-12 22:20:25,843 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1012 states. [2019-01-12 22:20:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states. [2019-01-12 22:20:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 22:20:25,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:25,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:25,860 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:25,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:25,867 INFO L82 PathProgramCache]: Analyzing trace with hash 573491188, now seen corresponding path program 1 times [2019-01-12 22:20:25,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:25,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:25,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:26,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:20:26,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:20:26,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:20:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:20:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:20:26,261 INFO L87 Difference]: Start difference. First operand 1012 states. Second operand 5 states. [2019-01-12 22:20:26,437 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 22:20:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:26,590 INFO L93 Difference]: Finished difference Result 1411 states and 4051 transitions. [2019-01-12 22:20:26,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:20:26,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-12 22:20:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:26,613 INFO L225 Difference]: With dead ends: 1411 [2019-01-12 22:20:26,614 INFO L226 Difference]: Without dead ends: 322 [2019-01-12 22:20:26,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:20:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-12 22:20:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-01-12 22:20:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-12 22:20:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 820 transitions. [2019-01-12 22:20:26,688 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 820 transitions. Word has length 19 [2019-01-12 22:20:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:26,689 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 820 transitions. [2019-01-12 22:20:26,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:20:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 820 transitions. [2019-01-12 22:20:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 22:20:26,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:26,691 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] [2019-01-12 22:20:26,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -143811728, now seen corresponding path program 1 times [2019-01-12 22:20:26,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:26,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:26,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:26,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:20:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:20:26,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:20:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:20:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:20:26,850 INFO L87 Difference]: Start difference. First operand 322 states and 820 transitions. Second operand 5 states. [2019-01-12 22:20:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:26,961 INFO L93 Difference]: Finished difference Result 411 states and 998 transitions. [2019-01-12 22:20:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:20:26,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 22:20:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:26,969 INFO L225 Difference]: With dead ends: 411 [2019-01-12 22:20:26,969 INFO L226 Difference]: Without dead ends: 290 [2019-01-12 22:20:26,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:20:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-12 22:20:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2019-01-12 22:20:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-01-12 22:20:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 714 transitions. [2019-01-12 22:20:26,991 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 714 transitions. Word has length 22 [2019-01-12 22:20:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:26,992 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 714 transitions. [2019-01-12 22:20:26,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:20:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 714 transitions. [2019-01-12 22:20:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 22:20:26,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:26,994 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] [2019-01-12 22:20:26,994 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash 28324926, now seen corresponding path program 1 times [2019-01-12 22:20:26,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:26,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:27,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:27,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:27,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:27,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:20:27,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:20:27,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:20:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:20:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:20:27,136 INFO L87 Difference]: Start difference. First operand 290 states and 714 transitions. Second operand 6 states. [2019-01-12 22:20:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:27,356 INFO L93 Difference]: Finished difference Result 437 states and 1057 transitions. [2019-01-12 22:20:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:20:27,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-01-12 22:20:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:27,361 INFO L225 Difference]: With dead ends: 437 [2019-01-12 22:20:27,361 INFO L226 Difference]: Without dead ends: 309 [2019-01-12 22:20:27,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:20:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-12 22:20:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 299. [2019-01-12 22:20:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-01-12 22:20:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 732 transitions. [2019-01-12 22:20:27,401 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 732 transitions. Word has length 25 [2019-01-12 22:20:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:27,401 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 732 transitions. [2019-01-12 22:20:27,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:20:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 732 transitions. [2019-01-12 22:20:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 22:20:27,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:27,404 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] [2019-01-12 22:20:27,404 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 19387626, now seen corresponding path program 2 times [2019-01-12 22:20:27,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:27,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:27,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:27,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:20:27,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:20:27,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:20:27,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:20:27,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:20:27,590 INFO L87 Difference]: Start difference. First operand 299 states and 732 transitions. Second operand 6 states. [2019-01-12 22:20:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:27,854 INFO L93 Difference]: Finished difference Result 456 states and 1095 transitions. [2019-01-12 22:20:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:20:27,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-01-12 22:20:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:27,860 INFO L225 Difference]: With dead ends: 456 [2019-01-12 22:20:27,860 INFO L226 Difference]: Without dead ends: 319 [2019-01-12 22:20:27,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:20:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-12 22:20:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-01-12 22:20:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-01-12 22:20:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 772 transitions. [2019-01-12 22:20:27,881 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 772 transitions. Word has length 25 [2019-01-12 22:20:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:27,883 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 772 transitions. [2019-01-12 22:20:27,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:20:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 772 transitions. [2019-01-12 22:20:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 22:20:27,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:27,889 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:27,890 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1592611961, now seen corresponding path program 1 times [2019-01-12 22:20:27,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:27,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:27,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:28,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:28,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:28,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:28,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:28,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 22:20:28,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:20:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:20:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:20:28,474 INFO L87 Difference]: Start difference. First operand 319 states and 772 transitions. Second operand 8 states. [2019-01-12 22:20:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:28,764 INFO L93 Difference]: Finished difference Result 466 states and 1115 transitions. [2019-01-12 22:20:28,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:20:28,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 22:20:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:28,769 INFO L225 Difference]: With dead ends: 466 [2019-01-12 22:20:28,770 INFO L226 Difference]: Without dead ends: 335 [2019-01-12 22:20:28,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:20:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-12 22:20:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 300. [2019-01-12 22:20:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-12 22:20:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 734 transitions. [2019-01-12 22:20:28,782 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 734 transitions. Word has length 29 [2019-01-12 22:20:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:28,782 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 734 transitions. [2019-01-12 22:20:28,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:20:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 734 transitions. [2019-01-12 22:20:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 22:20:28,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:28,784 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:28,784 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2035666861, now seen corresponding path program 1 times [2019-01-12 22:20:28,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:28,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:28,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:29,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:29,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:29,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:29,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:29,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:29,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 22:20:29,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:20:29,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:20:29,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:20:29,209 INFO L87 Difference]: Start difference. First operand 300 states and 734 transitions. Second operand 8 states. [2019-01-12 22:20:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:29,395 INFO L93 Difference]: Finished difference Result 482 states and 1147 transitions. [2019-01-12 22:20:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:20:29,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 22:20:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:29,403 INFO L225 Difference]: With dead ends: 482 [2019-01-12 22:20:29,403 INFO L226 Difference]: Without dead ends: 351 [2019-01-12 22:20:29,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:20:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-01-12 22:20:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-01-12 22:20:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-12 22:20:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 836 transitions. [2019-01-12 22:20:29,417 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 836 transitions. Word has length 29 [2019-01-12 22:20:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:29,418 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 836 transitions. [2019-01-12 22:20:29,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:20:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 836 transitions. [2019-01-12 22:20:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 22:20:29,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:29,421 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:29,421 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:29,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash -460714038, now seen corresponding path program 1 times [2019-01-12 22:20:29,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:29,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:29,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:29,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:29,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:29,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:29,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:29,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-12 22:20:29,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 22:20:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 22:20:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:20:29,785 INFO L87 Difference]: Start difference. First operand 351 states and 836 transitions. Second operand 9 states. [2019-01-12 22:20:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:30,034 INFO L93 Difference]: Finished difference Result 498 states and 1179 transitions. [2019-01-12 22:20:30,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:20:30,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 22:20:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:30,039 INFO L225 Difference]: With dead ends: 498 [2019-01-12 22:20:30,039 INFO L226 Difference]: Without dead ends: 367 [2019-01-12 22:20:30,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:20:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-01-12 22:20:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 316. [2019-01-12 22:20:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-12 22:20:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 766 transitions. [2019-01-12 22:20:30,048 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 766 transitions. Word has length 33 [2019-01-12 22:20:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:30,049 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 766 transitions. [2019-01-12 22:20:30,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 22:20:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 766 transitions. [2019-01-12 22:20:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 22:20:30,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:30,050 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:30,051 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1110322378, now seen corresponding path program 2 times [2019-01-12 22:20:30,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:30,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:30,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:30,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:30,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:30,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:30,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:20:30,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:20:30,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:30,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:30,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:30,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-12 22:20:30,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 22:20:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 22:20:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:20:30,514 INFO L87 Difference]: Start difference. First operand 316 states and 766 transitions. Second operand 9 states. [2019-01-12 22:20:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:30,746 INFO L93 Difference]: Finished difference Result 514 states and 1211 transitions. [2019-01-12 22:20:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:20:30,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 22:20:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:30,751 INFO L225 Difference]: With dead ends: 514 [2019-01-12 22:20:30,751 INFO L226 Difference]: Without dead ends: 383 [2019-01-12 22:20:30,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:20:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-01-12 22:20:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-01-12 22:20:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-01-12 22:20:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 900 transitions. [2019-01-12 22:20:30,762 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 900 transitions. Word has length 33 [2019-01-12 22:20:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:30,763 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 900 transitions. [2019-01-12 22:20:30,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 22:20:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 900 transitions. [2019-01-12 22:20:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 22:20:30,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:30,764 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:30,764 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2061178471, now seen corresponding path program 3 times [2019-01-12 22:20:30,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:30,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:30,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:30,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:30,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:30,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:20:31,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 22:20:31,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:31,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:31,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:31,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 22:20:31,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:20:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:20:31,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:20:31,177 INFO L87 Difference]: Start difference. First operand 383 states and 900 transitions. Second operand 10 states. [2019-01-12 22:20:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:31,383 INFO L93 Difference]: Finished difference Result 530 states and 1243 transitions. [2019-01-12 22:20:31,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:20:31,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-01-12 22:20:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:31,388 INFO L225 Difference]: With dead ends: 530 [2019-01-12 22:20:31,388 INFO L226 Difference]: Without dead ends: 399 [2019-01-12 22:20:31,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:20:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-12 22:20:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 332. [2019-01-12 22:20:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-12 22:20:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 798 transitions. [2019-01-12 22:20:31,400 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 798 transitions. Word has length 37 [2019-01-12 22:20:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:31,400 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 798 transitions. [2019-01-12 22:20:31,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:20:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 798 transitions. [2019-01-12 22:20:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 22:20:31,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:31,406 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:31,406 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1649592435, now seen corresponding path program 4 times [2019-01-12 22:20:31,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:31,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:31,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:31,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:31,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:31,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:31,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 22:20:31,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 22:20:31,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:31,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:31,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:31,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 22:20:31,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:20:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:20:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:20:31,715 INFO L87 Difference]: Start difference. First operand 332 states and 798 transitions. Second operand 10 states. [2019-01-12 22:20:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:31,885 INFO L93 Difference]: Finished difference Result 546 states and 1275 transitions. [2019-01-12 22:20:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:20:31,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-01-12 22:20:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:31,890 INFO L225 Difference]: With dead ends: 546 [2019-01-12 22:20:31,890 INFO L226 Difference]: Without dead ends: 415 [2019-01-12 22:20:31,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:20:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-12 22:20:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2019-01-12 22:20:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-01-12 22:20:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 964 transitions. [2019-01-12 22:20:31,900 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 964 transitions. Word has length 37 [2019-01-12 22:20:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:31,901 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 964 transitions. [2019-01-12 22:20:31,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:20:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 964 transitions. [2019-01-12 22:20:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 22:20:31,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:31,902 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:31,902 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2086800042, now seen corresponding path program 5 times [2019-01-12 22:20:31,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:31,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:31,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:32,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:32,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 22:20:32,204 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-01-12 22:20:32,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:32,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:32,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:32,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-12 22:20:32,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:20:32,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:20:32,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:20:32,266 INFO L87 Difference]: Start difference. First operand 415 states and 964 transitions. Second operand 11 states. [2019-01-12 22:20:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:32,574 INFO L93 Difference]: Finished difference Result 562 states and 1307 transitions. [2019-01-12 22:20:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:20:32,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-01-12 22:20:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:32,580 INFO L225 Difference]: With dead ends: 562 [2019-01-12 22:20:32,580 INFO L226 Difference]: Without dead ends: 431 [2019-01-12 22:20:32,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:20:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-01-12 22:20:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 348. [2019-01-12 22:20:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 22:20:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 830 transitions. [2019-01-12 22:20:32,589 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 830 transitions. Word has length 41 [2019-01-12 22:20:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:32,591 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 830 transitions. [2019-01-12 22:20:32,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:20:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 830 transitions. [2019-01-12 22:20:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 22:20:32,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:32,592 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:32,592 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:32,594 INFO L82 PathProgramCache]: Analyzing trace with hash 449750186, now seen corresponding path program 6 times [2019-01-12 22:20:32,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:32,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:32,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:32,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:32,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:32,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:32,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:32,905 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 22:20:32,969 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-01-12 22:20:32,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:32,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:33,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-12 22:20:33,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:20:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:20:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:20:33,039 INFO L87 Difference]: Start difference. First operand 348 states and 830 transitions. Second operand 11 states. [2019-01-12 22:20:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:33,255 INFO L93 Difference]: Finished difference Result 578 states and 1339 transitions. [2019-01-12 22:20:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:20:33,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-01-12 22:20:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:33,260 INFO L225 Difference]: With dead ends: 578 [2019-01-12 22:20:33,260 INFO L226 Difference]: Without dead ends: 447 [2019-01-12 22:20:33,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:20:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-01-12 22:20:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2019-01-12 22:20:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-12 22:20:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1028 transitions. [2019-01-12 22:20:33,271 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1028 transitions. Word has length 41 [2019-01-12 22:20:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:33,271 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 1028 transitions. [2019-01-12 22:20:33,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:20:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1028 transitions. [2019-01-12 22:20:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 22:20:33,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:33,272 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:33,273 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash 511353159, now seen corresponding path program 7 times [2019-01-12 22:20:33,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:33,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:33,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:33,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:33,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:33,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:33,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:33,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:33,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 22:20:33,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 22:20:33,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 22:20:33,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:20:33,812 INFO L87 Difference]: Start difference. First operand 447 states and 1028 transitions. Second operand 12 states. [2019-01-12 22:20:34,193 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 22:20:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:34,341 INFO L93 Difference]: Finished difference Result 594 states and 1371 transitions. [2019-01-12 22:20:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:20:34,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-12 22:20:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:34,346 INFO L225 Difference]: With dead ends: 594 [2019-01-12 22:20:34,346 INFO L226 Difference]: Without dead ends: 463 [2019-01-12 22:20:34,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:20:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-01-12 22:20:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 364. [2019-01-12 22:20:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-01-12 22:20:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 862 transitions. [2019-01-12 22:20:34,355 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 862 transitions. Word has length 45 [2019-01-12 22:20:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:34,356 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 862 transitions. [2019-01-12 22:20:34,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 22:20:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 862 transitions. [2019-01-12 22:20:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 22:20:34,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:34,357 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:34,357 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1081163923, now seen corresponding path program 8 times [2019-01-12 22:20:34,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:34,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:34,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:34,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:34,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:20:34,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:20:34,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:34,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:34,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:34,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 22:20:34,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 22:20:34,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 22:20:34,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:20:34,636 INFO L87 Difference]: Start difference. First operand 364 states and 862 transitions. Second operand 12 states. [2019-01-12 22:20:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:34,838 INFO L93 Difference]: Finished difference Result 610 states and 1403 transitions. [2019-01-12 22:20:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:20:34,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-12 22:20:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:34,842 INFO L225 Difference]: With dead ends: 610 [2019-01-12 22:20:34,842 INFO L226 Difference]: Without dead ends: 479 [2019-01-12 22:20:34,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:20:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-01-12 22:20:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-01-12 22:20:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-01-12 22:20:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1092 transitions. [2019-01-12 22:20:34,855 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1092 transitions. Word has length 45 [2019-01-12 22:20:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:34,856 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1092 transitions. [2019-01-12 22:20:34,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 22:20:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1092 transitions. [2019-01-12 22:20:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:20:34,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:34,857 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:34,857 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash -578738806, now seen corresponding path program 9 times [2019-01-12 22:20:34,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:34,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:34,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:34,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:34,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:35,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:35,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:35,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:20:35,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 22:20:35,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:35,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:35,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:35,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-12 22:20:35,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:20:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:20:35,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:20:35,196 INFO L87 Difference]: Start difference. First operand 479 states and 1092 transitions. Second operand 13 states. [2019-01-12 22:20:35,535 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 22:20:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:35,640 INFO L93 Difference]: Finished difference Result 626 states and 1435 transitions. [2019-01-12 22:20:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:20:35,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-01-12 22:20:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:35,646 INFO L225 Difference]: With dead ends: 626 [2019-01-12 22:20:35,646 INFO L226 Difference]: Without dead ends: 495 [2019-01-12 22:20:35,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:20:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-01-12 22:20:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 380. [2019-01-12 22:20:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-12 22:20:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 894 transitions. [2019-01-12 22:20:35,656 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 894 transitions. Word has length 49 [2019-01-12 22:20:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:35,656 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 894 transitions. [2019-01-12 22:20:35,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:20:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 894 transitions. [2019-01-12 22:20:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:20:35,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:35,657 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:35,657 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash -555139958, now seen corresponding path program 10 times [2019-01-12 22:20:35,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:35,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:35,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:35,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:35,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:35,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:35,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:35,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 22:20:35,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 22:20:35,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:35,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:36,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:36,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-12 22:20:36,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:20:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:20:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:20:36,056 INFO L87 Difference]: Start difference. First operand 380 states and 894 transitions. Second operand 13 states. [2019-01-12 22:20:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:36,391 INFO L93 Difference]: Finished difference Result 642 states and 1467 transitions. [2019-01-12 22:20:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:20:36,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-01-12 22:20:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:36,396 INFO L225 Difference]: With dead ends: 642 [2019-01-12 22:20:36,396 INFO L226 Difference]: Without dead ends: 511 [2019-01-12 22:20:36,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:20:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-01-12 22:20:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-01-12 22:20:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-01-12 22:20:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1156 transitions. [2019-01-12 22:20:36,406 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1156 transitions. Word has length 49 [2019-01-12 22:20:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:36,406 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 1156 transitions. [2019-01-12 22:20:36,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:20:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1156 transitions. [2019-01-12 22:20:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:20:36,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:36,408 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:36,408 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1389448231, now seen corresponding path program 11 times [2019-01-12 22:20:36,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:36,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:36,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:36,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:36,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:36,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:36,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:36,594 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 22:20:36,662 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-12 22:20:36,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:36,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:36,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-12 22:20:36,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:20:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:20:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:20:36,736 INFO L87 Difference]: Start difference. First operand 511 states and 1156 transitions. Second operand 14 states. [2019-01-12 22:20:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:36,977 INFO L93 Difference]: Finished difference Result 658 states and 1499 transitions. [2019-01-12 22:20:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:20:36,978 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-01-12 22:20:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:36,981 INFO L225 Difference]: With dead ends: 658 [2019-01-12 22:20:36,981 INFO L226 Difference]: Without dead ends: 527 [2019-01-12 22:20:36,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:20:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-01-12 22:20:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 396. [2019-01-12 22:20:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-12 22:20:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 926 transitions. [2019-01-12 22:20:36,990 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 926 transitions. Word has length 53 [2019-01-12 22:20:36,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:36,991 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 926 transitions. [2019-01-12 22:20:36,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:20:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 926 transitions. [2019-01-12 22:20:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:20:36,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:36,992 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:36,992 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1121609549, now seen corresponding path program 12 times [2019-01-12 22:20:36,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:36,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:36,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:36,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:37,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:37,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:37,191 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 22:20:37,216 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-01-12 22:20:37,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:37,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:37,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:37,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-12 22:20:37,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:20:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:20:37,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:20:37,275 INFO L87 Difference]: Start difference. First operand 396 states and 926 transitions. Second operand 14 states. [2019-01-12 22:20:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:37,560 INFO L93 Difference]: Finished difference Result 674 states and 1531 transitions. [2019-01-12 22:20:37,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:20:37,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-01-12 22:20:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:37,564 INFO L225 Difference]: With dead ends: 674 [2019-01-12 22:20:37,564 INFO L226 Difference]: Without dead ends: 543 [2019-01-12 22:20:37,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:20:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-12 22:20:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-01-12 22:20:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-01-12 22:20:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1220 transitions. [2019-01-12 22:20:37,574 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1220 transitions. Word has length 53 [2019-01-12 22:20:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:37,575 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 1220 transitions. [2019-01-12 22:20:37,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:20:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1220 transitions. [2019-01-12 22:20:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 22:20:37,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:37,576 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:37,576 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:37,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1590124650, now seen corresponding path program 13 times [2019-01-12 22:20:37,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:37,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:37,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:37,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:37,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:38,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:38,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:38,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:38,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:38,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:38,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-01-12 22:20:38,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 22:20:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 22:20:38,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:20:38,363 INFO L87 Difference]: Start difference. First operand 543 states and 1220 transitions. Second operand 15 states. [2019-01-12 22:20:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:38,646 INFO L93 Difference]: Finished difference Result 690 states and 1563 transitions. [2019-01-12 22:20:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:20:38,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-01-12 22:20:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:38,651 INFO L225 Difference]: With dead ends: 690 [2019-01-12 22:20:38,651 INFO L226 Difference]: Without dead ends: 559 [2019-01-12 22:20:38,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2019-01-12 22:20:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-01-12 22:20:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 412. [2019-01-12 22:20:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-12 22:20:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 958 transitions. [2019-01-12 22:20:38,660 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 958 transitions. Word has length 57 [2019-01-12 22:20:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:38,661 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 958 transitions. [2019-01-12 22:20:38,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 22:20:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 958 transitions. [2019-01-12 22:20:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 22:20:38,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:38,662 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:20:38,662 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:38,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:38,663 INFO L82 PathProgramCache]: Analyzing trace with hash 39711850, now seen corresponding path program 14 times [2019-01-12 22:20:38,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:38,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:38,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:20:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:20:38,726 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:20:38,835 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:20:38,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:20:38 BasicIcfg [2019-01-12 22:20:38,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:20:38,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:20:38,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:20:38,839 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:20:38,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:20:25" (3/4) ... [2019-01-12 22:20:38,842 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:20:38,930 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:20:38,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:20:38,931 INFO L168 Benchmark]: Toolchain (without parser) took 14595.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.9 MB). Free memory was 951.4 MB in the beginning and 912.1 MB in the end (delta: 39.2 MB). Peak memory consumption was 329.2 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:38,933 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:20:38,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:38,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:20:38,934 INFO L168 Benchmark]: Boogie Preprocessor took 44.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:20:38,934 INFO L168 Benchmark]: RCFGBuilder took 531.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:38,937 INFO L168 Benchmark]: TraceAbstraction took 13185.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 921.3 MB in the end (delta: 138.0 MB). Peak memory consumption was 314.2 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:38,938 INFO L168 Benchmark]: Witness Printer took 90.76 ms. Allocated memory is still 1.3 GB. Free memory was 921.3 MB in the beginning and 912.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:38,943 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.46 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 682.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 531.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13185.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 921.3 MB in the end (delta: 138.0 MB). Peak memory consumption was 314.2 MB. Max. memory is 11.5 GB. * Witness Printer took 90.76 ms. Allocated memory is still 1.3 GB. Free memory was 921.3 MB in the beginning and 912.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L660] -1 int i = 3, j = 6; VAL [i=3, j=6] [L678] -1 pthread_t id1, id2; VAL [i=3, j=6] [L679] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L662] 0 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L680] FCALL, FORK -1 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L670] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L662] COND TRUE 0 k < 5 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L670] COND TRUE 1 k < 5 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=0] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L662] COND TRUE 0 k < 5 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L670] COND TRUE 1 k < 5 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L662] COND TRUE 0 k < 5 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L670] COND TRUE 1 k < 5 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L662] COND TRUE 0 k < 5 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L670] COND TRUE 1 k < 5 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L662] COND TRUE 0 k < 5 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L670] COND TRUE 1 k < 5 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L682] -1 int condI = i >= (2*5 +6); [L685] -1 int condJ = j >= (2*5 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L687] COND TRUE -1 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L688] -1 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 64 locations, 1 error locations. UNSAFE Result, 13.0s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1038 SDtfs, 3615 SDslu, 4258 SDs, 0 SdLazy, 854 SolverSat, 411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred 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: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 738 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1410 NumberOfCodeBlocks, 1410 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1319 ConstructedInterpolants, 0 QuantifiedInterpolants, 167867 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1712 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 0/576 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...