./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5c28b64dced7375be2011a670be7b0024d9ff8d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 05:52:23,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:52:23,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:52:23,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:52:23,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:52:23,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:52:23,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:52:23,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:52:23,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:52:23,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:52:23,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:52:23,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:52:23,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:52:23,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:52:23,531 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:52:23,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:52:23,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:52:23,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:52:23,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:52:23,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:52:23,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:52:23,541 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:52:23,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:52:23,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:52:23,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:52:23,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:52:23,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:52:23,547 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:52:23,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:52:23,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:52:23,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:52:23,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:52:23,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:52:23,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:52:23,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:52:23,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:52:23,553 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:52:23,568 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:52:23,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:52:23,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:52:23,570 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:52:23,571 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:52:23,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:52:23,571 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:52:23,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:52:23,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:52:23,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:52:23,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:52:23,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:52:23,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:52:23,572 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:52:23,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:52:23,573 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:52:23,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:52:23,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:52:23,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:52:23,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:52:23,574 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:52:23,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:52:23,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:52:23,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:52:23,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:52:23,575 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:52:23,575 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:52:23,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:52:23,575 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 -> e5c28b64dced7375be2011a670be7b0024d9ff8d [2019-01-13 05:52:23,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:52:23,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:52:23,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:52:23,645 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:52:23,646 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:52:23,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i [2019-01-13 05:52:23,711 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a6bea71/c9b620b913ef465aa87527d6b020f7fa/FLAG48c2f6902 [2019-01-13 05:52:24,288 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:52:24,292 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i [2019-01-13 05:52:24,305 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a6bea71/c9b620b913ef465aa87527d6b020f7fa/FLAG48c2f6902 [2019-01-13 05:52:24,533 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a6bea71/c9b620b913ef465aa87527d6b020f7fa [2019-01-13 05:52:24,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:52:24,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:52:24,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:52:24,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:52:24,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:52:24,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:24,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17252cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:24, skipping insertion in model container [2019-01-13 05:52:24,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:52:24" (1/1) ... [2019-01-13 05:52:24,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:52:24,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:52:25,064 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:52:25,077 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:52:25,212 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:52:25,293 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:52:25,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25 WrapperNode [2019-01-13 05:52:25,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:52:25,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:52:25,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:52:25,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:52:25,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:52:25,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:52:25,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:52:25,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:52:25,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (1/1) ... [2019-01-13 05:52:25,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:52:25,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:52:25,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:52:25,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:52:25,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52: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-13 05:52:25,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:52:25,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:52:25,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:52:25,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:52:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:52:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:52:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:52:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:52:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 05:52:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 05:52:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-13 05:52:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-13 05:52:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:52:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:52:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:52:25,447 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:52:26,002 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:52:26,003 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-13 05:52:26,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:52:26 BoogieIcfgContainer [2019-01-13 05:52:26,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:52:26,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:52:26,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:52:26,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:52:26,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:52:24" (1/3) ... [2019-01-13 05:52:26,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db68fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:52:26, skipping insertion in model container [2019-01-13 05:52:26,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:52:25" (2/3) ... [2019-01-13 05:52:26,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db68fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:52:26, skipping insertion in model container [2019-01-13 05:52:26,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:52:26" (3/3) ... [2019-01-13 05:52:26,018 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_tso.opt_true-unreach-call.i [2019-01-13 05:52:26,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,066 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,071 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,071 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,077 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,079 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,079 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,082 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,083 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,083 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,084 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,084 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,084 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,084 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,086 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,086 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,086 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:52:26,114 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:52:26,114 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:52:26,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-13 05:52:26,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-13 05:52:26,162 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:52:26,162 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:52:26,162 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:52:26,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:52:26,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:52:26,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:52:26,163 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:52:26,163 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:52:26,163 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:52:26,175 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70places, 66 transitions [2019-01-13 05:52:27,240 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13138 states. [2019-01-13 05:52:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states. [2019-01-13 05:52:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 05:52:27,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:27,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:27,285 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1445141644, now seen corresponding path program 1 times [2019-01-13 05:52:27,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:27,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:27,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:27,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:52:27,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:52:27,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:52:27,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:52:27,688 INFO L87 Difference]: Start difference. First operand 13138 states. Second operand 4 states. [2019-01-13 05:52:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:28,071 INFO L93 Difference]: Finished difference Result 13744 states and 55795 transitions. [2019-01-13 05:52:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:52:28,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 05:52:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:28,341 INFO L225 Difference]: With dead ends: 13744 [2019-01-13 05:52:28,343 INFO L226 Difference]: Without dead ends: 5631 [2019-01-13 05:52:28,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:52:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-01-13 05:52:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5631. [2019-01-13 05:52:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5631 states. [2019-01-13 05:52:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5631 states to 5631 states and 22354 transitions. [2019-01-13 05:52:28,734 INFO L78 Accepts]: Start accepts. Automaton has 5631 states and 22354 transitions. Word has length 37 [2019-01-13 05:52:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:28,736 INFO L480 AbstractCegarLoop]: Abstraction has 5631 states and 22354 transitions. [2019-01-13 05:52:28,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:52:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5631 states and 22354 transitions. [2019-01-13 05:52:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 05:52:28,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:28,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:28,745 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1883999228, now seen corresponding path program 1 times [2019-01-13 05:52:28,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:28,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:28,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:28,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:29,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:29,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:52:29,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:52:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:52:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:52:29,124 INFO L87 Difference]: Start difference. First operand 5631 states and 22354 transitions. Second operand 5 states. [2019-01-13 05:52:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:29,782 INFO L93 Difference]: Finished difference Result 6143 states and 23834 transitions. [2019-01-13 05:52:29,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:52:29,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-01-13 05:52:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:29,833 INFO L225 Difference]: With dead ends: 6143 [2019-01-13 05:52:29,834 INFO L226 Difference]: Without dead ends: 5519 [2019-01-13 05:52:29,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:52:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2019-01-13 05:52:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5519. [2019-01-13 05:52:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2019-01-13 05:52:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 21822 transitions. [2019-01-13 05:52:30,049 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 21822 transitions. Word has length 38 [2019-01-13 05:52:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:30,050 INFO L480 AbstractCegarLoop]: Abstraction has 5519 states and 21822 transitions. [2019-01-13 05:52:30,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:52:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 21822 transitions. [2019-01-13 05:52:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:52:30,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:30,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:30,059 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1586589234, now seen corresponding path program 1 times [2019-01-13 05:52:30,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:30,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:30,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:30,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:30,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:30,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:30,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:52:30,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:52:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:52:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:52:30,310 INFO L87 Difference]: Start difference. First operand 5519 states and 21822 transitions. Second operand 6 states. [2019-01-13 05:52:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:30,804 INFO L93 Difference]: Finished difference Result 5455 states and 20830 transitions. [2019-01-13 05:52:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:52:30,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-13 05:52:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:30,838 INFO L225 Difference]: With dead ends: 5455 [2019-01-13 05:52:30,839 INFO L226 Difference]: Without dead ends: 4847 [2019-01-13 05:52:30,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:52:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2019-01-13 05:52:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4847. [2019-01-13 05:52:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2019-01-13 05:52:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 18798 transitions. [2019-01-13 05:52:31,004 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 18798 transitions. Word has length 39 [2019-01-13 05:52:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:31,004 INFO L480 AbstractCegarLoop]: Abstraction has 4847 states and 18798 transitions. [2019-01-13 05:52:31,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:52:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 18798 transitions. [2019-01-13 05:52:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 05:52:31,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:31,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:31,015 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2117960818, now seen corresponding path program 1 times [2019-01-13 05:52:31,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:31,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:31,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:31,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:31,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:52:31,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:52:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:52:31,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:52:31,431 INFO L87 Difference]: Start difference. First operand 4847 states and 18798 transitions. Second operand 7 states. [2019-01-13 05:52:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:32,079 INFO L93 Difference]: Finished difference Result 3567 states and 13038 transitions. [2019-01-13 05:52:32,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:52:32,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-01-13 05:52:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:32,111 INFO L225 Difference]: With dead ends: 3567 [2019-01-13 05:52:32,112 INFO L226 Difference]: Without dead ends: 3055 [2019-01-13 05:52:32,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:52:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-01-13 05:52:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3055. [2019-01-13 05:52:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2019-01-13 05:52:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 11182 transitions. [2019-01-13 05:52:32,272 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 11182 transitions. Word has length 40 [2019-01-13 05:52:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:32,276 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 11182 transitions. [2019-01-13 05:52:32,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:52:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 11182 transitions. [2019-01-13 05:52:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:32,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:32,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:32,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2066804268, now seen corresponding path program 1 times [2019-01-13 05:52:32,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:32,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:32,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:32,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:33,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:33,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:52:33,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:52:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:52:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:52:33,005 INFO L87 Difference]: Start difference. First operand 3055 states and 11182 transitions. Second operand 12 states. [2019-01-13 05:52:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:33,528 INFO L93 Difference]: Finished difference Result 5279 states and 19302 transitions. [2019-01-13 05:52:33,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:52:33,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-13 05:52:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:33,545 INFO L225 Difference]: With dead ends: 5279 [2019-01-13 05:52:33,545 INFO L226 Difference]: Without dead ends: 3003 [2019-01-13 05:52:33,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-13 05:52:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2019-01-13 05:52:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 3003. [2019-01-13 05:52:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-01-13 05:52:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 11022 transitions. [2019-01-13 05:52:33,640 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 11022 transitions. Word has length 41 [2019-01-13 05:52:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:33,641 INFO L480 AbstractCegarLoop]: Abstraction has 3003 states and 11022 transitions. [2019-01-13 05:52:33,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:52:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 11022 transitions. [2019-01-13 05:52:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:33,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:33,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:33,649 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:33,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash -994845904, now seen corresponding path program 2 times [2019-01-13 05:52:33,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:33,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:33,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:52:33,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:33,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:33,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:52:33,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:52:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:52:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:52:33,853 INFO L87 Difference]: Start difference. First operand 3003 states and 11022 transitions. Second operand 7 states. [2019-01-13 05:52:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:33,997 INFO L93 Difference]: Finished difference Result 4923 states and 18158 transitions. [2019-01-13 05:52:33,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:52:33,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-13 05:52:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:34,009 INFO L225 Difference]: With dead ends: 4923 [2019-01-13 05:52:34,010 INFO L226 Difference]: Without dead ends: 2663 [2019-01-13 05:52:34,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:52:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2019-01-13 05:52:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2663. [2019-01-13 05:52:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2663 states. [2019-01-13 05:52:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 9870 transitions. [2019-01-13 05:52:34,094 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 9870 transitions. Word has length 41 [2019-01-13 05:52:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:34,094 INFO L480 AbstractCegarLoop]: Abstraction has 2663 states and 9870 transitions. [2019-01-13 05:52:34,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:52:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 9870 transitions. [2019-01-13 05:52:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:34,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:34,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:34,101 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2040016274, now seen corresponding path program 3 times [2019-01-13 05:52:34,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:34,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:34,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:34,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:52:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:34,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:34,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:52:34,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:52:34,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:52:34,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:52:34,296 INFO L87 Difference]: Start difference. First operand 2663 states and 9870 transitions. Second operand 7 states. [2019-01-13 05:52:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:34,511 INFO L93 Difference]: Finished difference Result 4263 states and 15966 transitions. [2019-01-13 05:52:34,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:52:34,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-13 05:52:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:34,523 INFO L225 Difference]: With dead ends: 4263 [2019-01-13 05:52:34,523 INFO L226 Difference]: Without dead ends: 2263 [2019-01-13 05:52:34,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:52:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2019-01-13 05:52:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2019-01-13 05:52:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-01-13 05:52:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 8530 transitions. [2019-01-13 05:52:34,592 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 8530 transitions. Word has length 41 [2019-01-13 05:52:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:34,592 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 8530 transitions. [2019-01-13 05:52:34,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:52:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 8530 transitions. [2019-01-13 05:52:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:34,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:34,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:34,598 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash -390113582, now seen corresponding path program 4 times [2019-01-13 05:52:34,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:34,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:34,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:52:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:34,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:34,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:52:34,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:52:34,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:52:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:52:34,970 INFO L87 Difference]: Start difference. First operand 2263 states and 8530 transitions. Second operand 12 states. [2019-01-13 05:52:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:35,357 INFO L93 Difference]: Finished difference Result 3879 states and 14666 transitions. [2019-01-13 05:52:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:52:35,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-13 05:52:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:35,366 INFO L225 Difference]: With dead ends: 3879 [2019-01-13 05:52:35,366 INFO L226 Difference]: Without dead ends: 2243 [2019-01-13 05:52:35,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-13 05:52:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2019-01-13 05:52:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2019-01-13 05:52:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-01-13 05:52:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 8490 transitions. [2019-01-13 05:52:35,428 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 8490 transitions. Word has length 41 [2019-01-13 05:52:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:35,429 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 8490 transitions. [2019-01-13 05:52:35,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:52:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 8490 transitions. [2019-01-13 05:52:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 05:52:35,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:52:35,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:52:35,433 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:52:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:52:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash -663323788, now seen corresponding path program 5 times [2019-01-13 05:52:35,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:52:35,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:52:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:35,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:52:35,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:52:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:52:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:52:35,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:52:35,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:52:35,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:52:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:52:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:52:35,574 INFO L87 Difference]: Start difference. First operand 2243 states and 8490 transitions. Second operand 8 states. [2019-01-13 05:52:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:52:35,816 INFO L93 Difference]: Finished difference Result 1731 states and 6442 transitions. [2019-01-13 05:52:35,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:52:35,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-01-13 05:52:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:52:35,816 INFO L225 Difference]: With dead ends: 1731 [2019-01-13 05:52:35,816 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 05:52:35,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:52:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 05:52:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 05:52:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 05:52:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 05:52:35,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-13 05:52:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:52:35,820 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 05:52:35,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:52:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 05:52:35,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 05:52:35,826 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:52:35,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:52:35 BasicIcfg [2019-01-13 05:52:35,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:52:35,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:52:35,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:52:35,830 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:52:35,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:52:26" (3/4) ... [2019-01-13 05:52:35,836 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 05:52:35,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-13 05:52:35,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-13 05:52:35,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-13 05:52:35,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-13 05:52:35,850 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 05:52:35,851 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 05:52:35,907 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:52:35,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:52:35,908 INFO L168 Benchmark]: Toolchain (without parser) took 11370.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 952.7 MB in the beginning and 880.2 MB in the end (delta: 72.5 MB). Peak memory consumption was 375.0 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:35,912 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:52:35,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -140.1 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:35,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.53 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-13 05:52:35,917 INFO L168 Benchmark]: Boogie Preprocessor took 28.51 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:35,918 INFO L168 Benchmark]: RCFGBuilder took 628.44 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:35,921 INFO L168 Benchmark]: TraceAbstraction took 9820.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 890.1 MB in the end (delta: 169.9 MB). Peak memory consumption was 353.4 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:35,923 INFO L168 Benchmark]: Witness Printer took 77.99 ms. Allocated memory is still 1.3 GB. Free memory was 890.1 MB in the beginning and 880.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-01-13 05:52:35,927 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.17 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 753.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -140.1 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.53 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 28.51 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 628.44 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9820.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 890.1 MB in the end (delta: 169.9 MB). Peak memory consumption was 353.4 MB. Max. memory is 11.5 GB. * Witness Printer took 77.99 ms. Allocated memory is still 1.3 GB. Free memory was 890.1 MB in the beginning and 880.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 90 locations, 1 error locations. SAFE Result, 9.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 712 SDtfs, 1189 SDslu, 3012 SDs, 0 SdLazy, 410 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13138occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 50470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...