./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread/stack_longer_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/stack_longer_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 88d184f750ae7f3761c058885cf1dc5c9c85a913 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:18:58,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:18:58,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:18:58,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:18:58,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:18:58,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:18:58,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:18:58,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:18:58,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:18:58,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:18:58,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:18:58,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:18:58,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:18:58,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:18:58,762 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:18:58,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:18:58,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:18:58,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:18:58,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:18:58,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:18:58,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:18:58,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:18:58,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:18:58,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:18:58,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:18:58,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:18:58,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:18:58,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:18:58,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:18:58,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:18:58,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:18:58,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:18:58,781 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:18:58,781 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:18:58,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:18:58,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:18:58,783 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:18:58,804 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:18:58,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:18:58,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:18:58,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:18:58,806 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:18:58,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:18:58,806 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:18:58,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:18:58,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:18:58,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:18:58,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:18:58,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:18:58,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:18:58,807 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:18:58,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:18:58,808 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:18:58,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:18:58,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:18:58,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:18:58,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:18:58,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:18:58,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:18:58,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:18:58,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:18:58,809 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:18:58,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:18:58,810 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:18:58,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:18:58,810 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 -> 88d184f750ae7f3761c058885cf1dc5c9c85a913 [2019-01-12 22:18:58,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:18:58,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:18:58,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:18:58,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:18:58,861 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:18:58,862 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/stack_longer_false-unreach-call.i [2019-01-12 22:18:58,917 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36879710a/49b8b3e001f948978592734e7f2a64e9/FLAGd9cc0b82d [2019-01-12 22:18:59,488 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:18:59,489 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/stack_longer_false-unreach-call.i [2019-01-12 22:18:59,510 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36879710a/49b8b3e001f948978592734e7f2a64e9/FLAGd9cc0b82d [2019-01-12 22:18:59,711 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36879710a/49b8b3e001f948978592734e7f2a64e9 [2019-01-12 22:18:59,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:18:59,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:18:59,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:18:59,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:18:59,723 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:18:59,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:18:59" (1/1) ... [2019-01-12 22:18:59,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7d791d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:18:59, skipping insertion in model container [2019-01-12 22:18:59,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:18:59" (1/1) ... [2019-01-12 22:18:59,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:18:59,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:19:00,306 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:19:00,372 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:19:00,527 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:19:00,680 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:19:00,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00 WrapperNode [2019-01-12 22:19:00,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:19:00,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:19:00,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:19:00,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:19:00,691 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:19:00" (1/1) ... [2019-01-12 22:19:00,731 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:19:00" (1/1) ... [2019-01-12 22:19:00,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:19:00,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:19:00,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:19:00,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:19:00,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (1/1) ... [2019-01-12 22:19:00,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (1/1) ... [2019-01-12 22:19:00,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (1/1) ... [2019-01-12 22:19:00,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (1/1) ... [2019-01-12 22:19:00,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (1/1) ... [2019-01-12 22:19:00,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (1/1) ... [2019-01-12 22:19:00,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (1/1) ... [2019-01-12 22:19:00,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:19:00,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:19:00,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:19:00,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:19:00,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (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:19:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-01-12 22:19:00,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-01-12 22:19:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-01-12 22:19:00,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-01-12 22:19:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:19:00,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:19:00,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-12 22:19:00,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 22:19:00,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:19:00,906 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-01-12 22:19:00,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 22:19:00,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:19:00,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:19:00,909 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:19:01,758 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:19:01,760 INFO L286 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-12 22:19:01,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:19:01 BoogieIcfgContainer [2019-01-12 22:19:01,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:19:01,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:19:01,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:19:01,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:19:01,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:18:59" (1/3) ... [2019-01-12 22:19:01,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdf7e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:19:01, skipping insertion in model container [2019-01-12 22:19:01,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:00" (2/3) ... [2019-01-12 22:19:01,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdf7e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:19:01, skipping insertion in model container [2019-01-12 22:19:01,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:19:01" (3/3) ... [2019-01-12 22:19:01,771 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer_false-unreach-call.i [2019-01-12 22:19:01,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,819 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,819 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,819 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,820 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,820 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,823 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,823 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,825 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,826 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,827 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,828 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,829 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,829 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,832 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,832 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,833 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,838 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,838 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,838 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,841 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,842 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,844 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,844 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,844 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,844 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,845 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,845 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,845 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,848 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,850 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,850 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,850 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,851 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,851 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,851 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,852 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,853 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,854 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,855 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,862 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,862 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:01,913 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:19:01,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:19:01,922 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-12 22:19:01,936 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-12 22:19:01,959 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:19:01,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:19:01,960 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:19:01,960 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:19:01,960 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:19:01,960 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:19:01,960 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:19:01,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:19:01,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:19:01,973 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 139 transitions [2019-01-12 22:19:02,218 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6506 states. [2019-01-12 22:19:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states. [2019-01-12 22:19:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 22:19:02,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:02,266 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, 1, 1, 1, 1, 1] [2019-01-12 22:19:02,268 INFO L423 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1331807669, now seen corresponding path program 1 times [2019-01-12 22:19:02,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:02,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:02,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:02,603 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:19:02,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:02,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:19:02,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:19:02,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:19:02,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:19:02,630 INFO L87 Difference]: Start difference. First operand 6506 states. Second operand 3 states. [2019-01-12 22:19:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:02,932 INFO L93 Difference]: Finished difference Result 9854 states and 26353 transitions. [2019-01-12 22:19:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:19:02,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-12 22:19:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:03,040 INFO L225 Difference]: With dead ends: 9854 [2019-01-12 22:19:03,041 INFO L226 Difference]: Without dead ends: 9746 [2019-01-12 22:19:03,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:19:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-01-12 22:19:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8276. [2019-01-12 22:19:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2019-01-12 22:19:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 22334 transitions. [2019-01-12 22:19:03,472 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 22334 transitions. Word has length 46 [2019-01-12 22:19:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:03,475 INFO L480 AbstractCegarLoop]: Abstraction has 8276 states and 22334 transitions. [2019-01-12 22:19:03,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:19:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 22334 transitions. [2019-01-12 22:19:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:19:03,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:03,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:19:03,485 INFO L423 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:03,486 INFO L82 PathProgramCache]: Analyzing trace with hash 650392225, now seen corresponding path program 1 times [2019-01-12 22:19:03,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:03,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:03,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:03,695 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:19:03,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:03,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:19:03,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:19:03,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:19:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:19:03,699 INFO L87 Difference]: Start difference. First operand 8276 states and 22334 transitions. Second operand 3 states. [2019-01-12 22:19:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:03,867 INFO L93 Difference]: Finished difference Result 7697 states and 20469 transitions. [2019-01-12 22:19:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:19:03,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-12 22:19:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:03,917 INFO L225 Difference]: With dead ends: 7697 [2019-01-12 22:19:03,917 INFO L226 Difference]: Without dead ends: 7556 [2019-01-12 22:19:03,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:19:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2019-01-12 22:19:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 7328. [2019-01-12 22:19:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7328 states. [2019-01-12 22:19:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7328 states to 7328 states and 19608 transitions. [2019-01-12 22:19:04,207 INFO L78 Accepts]: Start accepts. Automaton has 7328 states and 19608 transitions. Word has length 50 [2019-01-12 22:19:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:04,209 INFO L480 AbstractCegarLoop]: Abstraction has 7328 states and 19608 transitions. [2019-01-12 22:19:04,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:19:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7328 states and 19608 transitions. [2019-01-12 22:19:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 22:19:04,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:04,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:19:04,215 INFO L423 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:04,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2124015952, now seen corresponding path program 1 times [2019-01-12 22:19:04,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:04,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:04,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:04,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:04,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:04,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-12 22:19:04,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:04,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:19:04,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:19:04,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:19:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:19:04,431 INFO L87 Difference]: Start difference. First operand 7328 states and 19608 transitions. Second operand 4 states. [2019-01-12 22:19:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:04,792 INFO L93 Difference]: Finished difference Result 10193 states and 27211 transitions. [2019-01-12 22:19:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:19:04,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-12 22:19:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:04,851 INFO L225 Difference]: With dead ends: 10193 [2019-01-12 22:19:04,852 INFO L226 Difference]: Without dead ends: 10193 [2019-01-12 22:19:04,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:19:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2019-01-12 22:19:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 7652. [2019-01-12 22:19:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7652 states. [2019-01-12 22:19:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 20475 transitions. [2019-01-12 22:19:05,069 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 20475 transitions. Word has length 55 [2019-01-12 22:19:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:05,070 INFO L480 AbstractCegarLoop]: Abstraction has 7652 states and 20475 transitions. [2019-01-12 22:19:05,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:19:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 20475 transitions. [2019-01-12 22:19:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 22:19:05,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:05,082 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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:19:05,083 INFO L423 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1863469886, now seen corresponding path program 1 times [2019-01-12 22:19:05,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:05,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:05,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:05,381 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:19:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:05,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:05,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:05,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-12 22:19:05,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:19:05,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:19:05,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:19:05,630 INFO L87 Difference]: Start difference. First operand 7652 states and 20475 transitions. Second operand 7 states. [2019-01-12 22:19:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:06,193 INFO L93 Difference]: Finished difference Result 11186 states and 29819 transitions. [2019-01-12 22:19:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:19:06,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2019-01-12 22:19:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:06,226 INFO L225 Difference]: With dead ends: 11186 [2019-01-12 22:19:06,227 INFO L226 Difference]: Without dead ends: 11186 [2019-01-12 22:19:06,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:19:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11186 states. [2019-01-12 22:19:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11186 to 9716. [2019-01-12 22:19:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9716 states. [2019-01-12 22:19:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9716 states to 9716 states and 26036 transitions. [2019-01-12 22:19:06,477 INFO L78 Accepts]: Start accepts. Automaton has 9716 states and 26036 transitions. Word has length 78 [2019-01-12 22:19:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:06,478 INFO L480 AbstractCegarLoop]: Abstraction has 9716 states and 26036 transitions. [2019-01-12 22:19:06,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:19:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9716 states and 26036 transitions. [2019-01-12 22:19:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-12 22:19:06,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:06,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:06,491 INFO L423 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash -598780544, now seen corresponding path program 1 times [2019-01-12 22:19:06,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:06,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:06,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:06,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:06,644 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:19:06,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:06,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:19:06,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:19:06,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:19:06,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:19:06,647 INFO L87 Difference]: Start difference. First operand 9716 states and 26036 transitions. Second operand 3 states. [2019-01-12 22:19:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:06,712 INFO L93 Difference]: Finished difference Result 4949 states and 12535 transitions. [2019-01-12 22:19:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:19:06,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-01-12 22:19:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:06,726 INFO L225 Difference]: With dead ends: 4949 [2019-01-12 22:19:06,726 INFO L226 Difference]: Without dead ends: 4949 [2019-01-12 22:19:06,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:19:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2019-01-12 22:19:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4844. [2019-01-12 22:19:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4844 states. [2019-01-12 22:19:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 12270 transitions. [2019-01-12 22:19:06,838 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 12270 transitions. Word has length 82 [2019-01-12 22:19:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:06,838 INFO L480 AbstractCegarLoop]: Abstraction has 4844 states and 12270 transitions. [2019-01-12 22:19:06,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:19:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 12270 transitions. [2019-01-12 22:19:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-12 22:19:06,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:06,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:06,846 INFO L423 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash 675060464, now seen corresponding path program 1 times [2019-01-12 22:19:06,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:06,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:07,350 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:19:07,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:07,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:19:07,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:19:07,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:19:07,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:19:07,355 INFO L87 Difference]: Start difference. First operand 4844 states and 12270 transitions. Second operand 7 states. [2019-01-12 22:19:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:07,653 INFO L93 Difference]: Finished difference Result 6383 states and 16124 transitions. [2019-01-12 22:19:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:19:07,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-01-12 22:19:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:07,666 INFO L225 Difference]: With dead ends: 6383 [2019-01-12 22:19:07,667 INFO L226 Difference]: Without dead ends: 6383 [2019-01-12 22:19:07,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:19:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2019-01-12 22:19:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 5249. [2019-01-12 22:19:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5249 states. [2019-01-12 22:19:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 13264 transitions. [2019-01-12 22:19:07,786 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 13264 transitions. Word has length 83 [2019-01-12 22:19:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:07,786 INFO L480 AbstractCegarLoop]: Abstraction has 5249 states and 13264 transitions. [2019-01-12 22:19:07,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:19:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 13264 transitions. [2019-01-12 22:19:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 22:19:07,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:07,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:07,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1218020344, now seen corresponding path program 1 times [2019-01-12 22:19:07,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:07,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:07,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:07,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:08,593 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-01-12 22:19:08,912 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-12 22:19:09,215 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-01-12 22:19:09,616 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2019-01-12 22:19:09,738 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-01-12 22:19:10,267 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-01-12 22:19:10,569 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-01-12 22:19:11,248 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:19:11,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:11,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:19:11,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:19:11,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:19:11,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:19:11,249 INFO L87 Difference]: Start difference. First operand 5249 states and 13264 transitions. Second operand 18 states. [2019-01-12 22:19:13,207 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-12 22:19:13,483 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-12 22:19:13,669 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-01-12 22:19:13,856 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 22:19:14,016 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-12 22:19:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:14,643 INFO L93 Difference]: Finished difference Result 11875 states and 30174 transitions. [2019-01-12 22:19:14,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 22:19:14,645 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-01-12 22:19:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:14,668 INFO L225 Difference]: With dead ends: 11875 [2019-01-12 22:19:14,669 INFO L226 Difference]: Without dead ends: 11875 [2019-01-12 22:19:14,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 22:19:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2019-01-12 22:19:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 7443. [2019-01-12 22:19:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7443 states. [2019-01-12 22:19:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 19054 transitions. [2019-01-12 22:19:14,854 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 19054 transitions. Word has length 93 [2019-01-12 22:19:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:14,855 INFO L480 AbstractCegarLoop]: Abstraction has 7443 states and 19054 transitions. [2019-01-12 22:19:14,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:19:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 19054 transitions. [2019-01-12 22:19:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 22:19:14,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:14,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,866 INFO L423 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:14,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2057552392, now seen corresponding path program 2 times [2019-01-12 22:19:14,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:14,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:14,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:15,414 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-01-12 22:19:15,872 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-01-12 22:19:16,058 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 26 [2019-01-12 22:19:16,206 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2019-01-12 22:19:16,900 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2019-01-12 22:19:17,071 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 20 [2019-01-12 22:19:17,435 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:19:17,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:17,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:19:17,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:19:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:19:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:19:17,436 INFO L87 Difference]: Start difference. First operand 7443 states and 19054 transitions. Second operand 18 states. [2019-01-12 22:19:18,648 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-01-12 22:19:19,149 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-01-12 22:19:19,739 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-01-12 22:19:20,243 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-01-12 22:19:20,804 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-01-12 22:19:21,364 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-12 22:19:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:22,024 INFO L93 Difference]: Finished difference Result 16959 states and 43556 transitions. [2019-01-12 22:19:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 22:19:22,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-01-12 22:19:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:22,042 INFO L225 Difference]: With dead ends: 16959 [2019-01-12 22:19:22,042 INFO L226 Difference]: Without dead ends: 16959 [2019-01-12 22:19:22,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2019-01-12 22:19:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16959 states. [2019-01-12 22:19:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16959 to 7103. [2019-01-12 22:19:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7103 states. [2019-01-12 22:19:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7103 states to 7103 states and 18097 transitions. [2019-01-12 22:19:22,254 INFO L78 Accepts]: Start accepts. Automaton has 7103 states and 18097 transitions. Word has length 93 [2019-01-12 22:19:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:22,255 INFO L480 AbstractCegarLoop]: Abstraction has 7103 states and 18097 transitions. [2019-01-12 22:19:22,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:19:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7103 states and 18097 transitions. [2019-01-12 22:19:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 22:19:22,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:22,269 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:19:22,270 INFO L423 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1004694727, now seen corresponding path program 2 times [2019-01-12 22:19:22,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:22,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:22,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:22,575 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:19:22,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:19:22,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:19:22,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:22,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:22,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:22,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-12 22:19:22,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 22:19:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 22:19:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:19:22,737 INFO L87 Difference]: Start difference. First operand 7103 states and 18097 transitions. Second operand 9 states. [2019-01-12 22:19:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:22,855 INFO L93 Difference]: Finished difference Result 9956 states and 25242 transitions. [2019-01-12 22:19:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:19:22,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-01-12 22:19:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:22,866 INFO L225 Difference]: With dead ends: 9956 [2019-01-12 22:19:22,866 INFO L226 Difference]: Without dead ends: 9956 [2019-01-12 22:19:22,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:19:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2019-01-12 22:19:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 8636. [2019-01-12 22:19:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2019-01-12 22:19:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 22048 transitions. [2019-01-12 22:19:23,036 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 22048 transitions. Word has length 110 [2019-01-12 22:19:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:23,036 INFO L480 AbstractCegarLoop]: Abstraction has 8636 states and 22048 transitions. [2019-01-12 22:19:23,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 22:19:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 22048 transitions. [2019-01-12 22:19:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:19:23,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:23,055 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,056 INFO L423 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash -878541265, now seen corresponding path program 1 times [2019-01-12 22:19:23,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:23,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:23,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:23,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:23,373 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:19:23,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:23,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 22:19:23,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:23,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-01-12 22:19:23,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:19:23,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:19:23,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:19:23,592 INFO L87 Difference]: Start difference. First operand 8636 states and 22048 transitions. Second operand 8 states. [2019-01-12 22:19:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:23,748 INFO L93 Difference]: Finished difference Result 11783 states and 29878 transitions. [2019-01-12 22:19:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:19:23,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-01-12 22:19:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:23,763 INFO L225 Difference]: With dead ends: 11783 [2019-01-12 22:19:23,764 INFO L226 Difference]: Without dead ends: 11783 [2019-01-12 22:19:23,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:19:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11783 states. [2019-01-12 22:19:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11783 to 9566. [2019-01-12 22:19:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9566 states. [2019-01-12 22:19:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9566 states to 9566 states and 24603 transitions. [2019-01-12 22:19:23,938 INFO L78 Accepts]: Start accepts. Automaton has 9566 states and 24603 transitions. Word has length 115 [2019-01-12 22:19:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:23,938 INFO L480 AbstractCegarLoop]: Abstraction has 9566 states and 24603 transitions. [2019-01-12 22:19:23,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:19:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9566 states and 24603 transitions. [2019-01-12 22:19:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:19:23,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:23,950 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,951 INFO L423 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1478973223, now seen corresponding path program 1 times [2019-01-12 22:19:23,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:23,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:24,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:24,542 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:19:24,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:24,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:24,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 22:19:24,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-01-12 22:19:24,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:19:24,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:19:24,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:19:24,728 INFO L87 Difference]: Start difference. First operand 9566 states and 24603 transitions. Second operand 11 states. [2019-01-12 22:19:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:24,973 INFO L93 Difference]: Finished difference Result 11693 states and 29799 transitions. [2019-01-12 22:19:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:19:24,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-01-12 22:19:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:24,988 INFO L225 Difference]: With dead ends: 11693 [2019-01-12 22:19:24,988 INFO L226 Difference]: Without dead ends: 11693 [2019-01-12 22:19:24,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:19:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11693 states. [2019-01-12 22:19:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11693 to 9695. [2019-01-12 22:19:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9695 states. [2019-01-12 22:19:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9695 states to 9695 states and 24960 transitions. [2019-01-12 22:19:25,142 INFO L78 Accepts]: Start accepts. Automaton has 9695 states and 24960 transitions. Word has length 115 [2019-01-12 22:19:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:25,143 INFO L480 AbstractCegarLoop]: Abstraction has 9695 states and 24960 transitions. [2019-01-12 22:19:25,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:19:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 9695 states and 24960 transitions. [2019-01-12 22:19:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 22:19:25,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:25,154 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:25,155 INFO L423 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash 482584338, now seen corresponding path program 1 times [2019-01-12 22:19:25,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:25,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:19:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:19:25,277 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:19:25,421 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:19:25,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:19:25 BasicIcfg [2019-01-12 22:19:25,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:19:25,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:19:25,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:19:25,425 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:19:25,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:19:01" (3/4) ... [2019-01-12 22:19:25,428 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:19:25,584 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:19:25,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:19:25,588 INFO L168 Benchmark]: Toolchain (without parser) took 25869.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 508.0 MB). Free memory was 946.0 MB in the beginning and 993.6 MB in the end (delta: -47.6 MB). Peak memory consumption was 460.4 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:25,589 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-12 22:19:25,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 964.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:25,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:19:25,592 INFO L168 Benchmark]: Boogie Preprocessor took 68.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:25,592 INFO L168 Benchmark]: RCFGBuilder took 913.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:25,593 INFO L168 Benchmark]: TraceAbstraction took 23661.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 375.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 389.1 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:25,594 INFO L168 Benchmark]: Witness Printer took 158.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:25,604 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 964.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 913.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23661.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 375.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 389.1 MB. Max. memory is 11.5 GB. * Witness Printer took 158.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L914] -1 static int top=0; VAL [top=0] [L915] -1 static unsigned int arr[(400)]; VAL [arr={2:0}, top=0] [L916] -1 pthread_mutex_t m; VAL [arr={2:0}, m={-4:0}, top=0] [L917] -1 _Bool flag=(0); VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L998] -1 pthread_t id1, id2; VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L1000] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L967] 0 int i; VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L968] 0 unsigned int tmp; VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L969] 0 i=0 VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L969] COND TRUE 0 i<(400) VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L1001] FCALL, FORK -1 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L983] 1 int i; VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L984] 1 i=0 VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L984] COND TRUE 1 i<(400) VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L972] 0 tmp = __VERIFIER_nondet_uint() VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L939] COND FALSE 0 !(top==(400)) VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L931] 0 return top; VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L946] 0 stack[get_top()] = x VAL [arr={2:0}, flag=0, m={-4:0}, top=0] [L923] 0 top++ VAL [arr={2:0}, flag=0, m={-4:0}, top=1] [L949] 0 return 0; VAL [arr={2:0}, flag=0, m={-4:0}, top=1] [L974] COND FALSE 0 !(push(arr,tmp)==(-1)) VAL [arr={2:0}, flag=0, m={-4:0}, top=1] [L976] 0 flag=(1) VAL [arr={2:0}, flag=1, m={-4:0}, top=1] [L987] COND TRUE 1 \read(flag) VAL [arr={2:0}, flag=1, m={-4:0}, top=1] [L931] 1 return top; VAL [arr={2:0}, flag=1, m={-4:0}, top=1] [L953] COND FALSE 1 !(get_top()==0) VAL [arr={2:0}, flag=1, m={-4:0}, top=1] [L927] 1 top-- VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L931] 1 return top; VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L961] EXPR 1 stack[get_top()] VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L961] 1 return stack[get_top()]; VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L989] COND FALSE 1 !(!(pop(arr)!=(-2))) VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L984] 1 i++ VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L984] COND TRUE 1 i<(400) VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L987] COND TRUE 1 \read(flag) VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L931] 1 return top; VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L953] COND TRUE 1 get_top()==0 VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L956] 1 return (-2); VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L989] COND TRUE 1 !(pop(arr)!=(-2)) VAL [arr={2:0}, flag=1, m={-4:0}, top=0] [L919] 1 __VERIFIER_error() VAL [arr={2:0}, flag=1, m={-4:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 4 error locations. UNSAFE Result, 23.4s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2060 SDtfs, 3391 SDslu, 8816 SDs, 0 SdLazy, 1370 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 435 SyntacticMatches, 13 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9716occurred in iteration=4, 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: 2.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 26771 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 1108001 SizeOfPredicates, 20 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 72/242 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...