./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 2e94e6aa 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-2e94e6a [2018-12-31 17:23:33,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 17:23:33,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 17:23:33,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 17:23:33,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 17:23:33,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 17:23:33,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 17:23:33,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 17:23:33,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 17:23:33,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 17:23:33,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 17:23:33,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 17:23:33,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 17:23:33,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 17:23:33,625 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 17:23:33,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 17:23:33,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 17:23:33,628 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 17:23:33,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 17:23:33,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 17:23:33,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 17:23:33,634 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 17:23:33,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 17:23:33,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 17:23:33,636 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 17:23:33,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 17:23:33,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 17:23:33,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 17:23:33,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 17:23:33,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 17:23:33,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 17:23:33,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 17:23:33,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 17:23:33,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 17:23:33,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 17:23:33,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 17:23:33,643 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 17:23:33,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 17:23:33,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 17:23:33,659 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 17:23:33,659 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 17:23:33,659 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 17:23:33,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 17:23:33,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 17:23:33,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 17:23:33,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 17:23:33,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 17:23:33,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 17:23:33,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 17:23:33,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 17:23:33,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 17:23:33,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 17:23:33,661 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 17:23:33,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 17:23:33,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 17:23:33,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 17:23:33,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 17:23:33,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 17:23:33,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 17:23:33,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 17:23:33,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 17:23:33,663 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 17:23:33,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 17:23:33,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 17:23:33,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 17:23:33,663 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 [2018-12-31 17:23:33,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 17:23:33,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 17:23:33,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 17:23:33,715 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 17:23:33,716 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 17:23:33,716 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/stack_longer_false-unreach-call.i [2018-12-31 17:23:33,785 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf586818/cec6e4f8f2d549209180358e6604ccad/FLAG99a68ce13 [2018-12-31 17:23:34,304 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 17:23:34,305 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/stack_longer_false-unreach-call.i [2018-12-31 17:23:34,322 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf586818/cec6e4f8f2d549209180358e6604ccad/FLAG99a68ce13 [2018-12-31 17:23:34,571 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf586818/cec6e4f8f2d549209180358e6604ccad [2018-12-31 17:23:34,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 17:23:34,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 17:23:34,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 17:23:34,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 17:23:34,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 17:23:34,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:23:34" (1/1) ... [2018-12-31 17:23:34,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a64539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:34, skipping insertion in model container [2018-12-31 17:23:34,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:23:34" (1/1) ... [2018-12-31 17:23:34,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 17:23:34,652 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 17:23:35,265 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:23:35,333 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 17:23:35,460 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:23:35,668 INFO L195 MainTranslator]: Completed translation [2018-12-31 17:23:35,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35 WrapperNode [2018-12-31 17:23:35,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 17:23:35,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 17:23:35,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 17:23:35,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 17:23:35,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 17:23:35,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 17:23:35,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 17:23:35,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 17:23:35,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (1/1) ... [2018-12-31 17:23:35,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 17:23:35,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 17:23:35,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 17:23:35,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 17:23:35,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (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 [2018-12-31 17:23:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2018-12-31 17:23:35,892 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2018-12-31 17:23:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2018-12-31 17:23:35,893 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2018-12-31 17:23:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 17:23:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 17:23:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 17:23:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 17:23:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 17:23:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2018-12-31 17:23:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 17:23:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 17:23:35,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 17:23:35,898 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 17:23:36,729 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 17:23:36,730 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-12-31 17:23:36,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:23:36 BoogieIcfgContainer [2018-12-31 17:23:36,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 17:23:36,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 17:23:36,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 17:23:36,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 17:23:36,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:23:34" (1/3) ... [2018-12-31 17:23:36,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037e2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:23:36, skipping insertion in model container [2018-12-31 17:23:36,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:35" (2/3) ... [2018-12-31 17:23:36,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037e2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:23:36, skipping insertion in model container [2018-12-31 17:23:36,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:23:36" (3/3) ... [2018-12-31 17:23:36,739 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer_false-unreach-call.i [2018-12-31 17:23:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,827 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,827 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,828 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,829 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,829 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,829 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,830 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,831 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,831 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,832 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,840 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,841 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,841 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,842 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,843 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,843 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,848 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,849 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,849 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,851 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,851 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,851 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,852 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,853 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,859 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,859 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,860 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,861 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,862 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,862 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,863 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,863 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,863 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,866 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,867 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,868 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,868 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,869 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,869 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,882 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,883 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:36,939 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 17:23:36,939 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 17:23:36,950 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-31 17:23:36,968 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-31 17:23:36,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 17:23:37,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 17:23:37,000 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 17:23:37,000 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 17:23:37,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 17:23:37,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 17:23:37,001 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 17:23:37,003 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 17:23:37,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 17:23:37,022 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 139 transitions [2018-12-31 17:23:37,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6506 states. [2018-12-31 17:23:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states. [2018-12-31 17:23:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 17:23:37,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:37,408 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] [2018-12-31 17:23:37,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1331807669, now seen corresponding path program 1 times [2018-12-31 17:23:37,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:37,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:37,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:37,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:37,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:37,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:37,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:23:37,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:23:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:23:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:23:37,829 INFO L87 Difference]: Start difference. First operand 6506 states. Second operand 3 states. [2018-12-31 17:23:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:38,170 INFO L93 Difference]: Finished difference Result 9854 states and 26353 transitions. [2018-12-31 17:23:38,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:23:38,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-31 17:23:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:38,259 INFO L225 Difference]: With dead ends: 9854 [2018-12-31 17:23:38,259 INFO L226 Difference]: Without dead ends: 9746 [2018-12-31 17:23:38,261 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 [2018-12-31 17:23:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2018-12-31 17:23:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8276. [2018-12-31 17:23:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2018-12-31 17:23:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 22334 transitions. [2018-12-31 17:23:38,718 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 22334 transitions. Word has length 46 [2018-12-31 17:23:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:38,718 INFO L480 AbstractCegarLoop]: Abstraction has 8276 states and 22334 transitions. [2018-12-31 17:23:38,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:23:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 22334 transitions. [2018-12-31 17:23:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 17:23:38,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:38,726 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] [2018-12-31 17:23:38,727 INFO L423 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash 650392225, now seen corresponding path program 1 times [2018-12-31 17:23:38,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:38,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:38,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:38,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:38,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:23:38,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:23:38,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:23:38,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:23:38,899 INFO L87 Difference]: Start difference. First operand 8276 states and 22334 transitions. Second operand 3 states. [2018-12-31 17:23:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:39,097 INFO L93 Difference]: Finished difference Result 7697 states and 20469 transitions. [2018-12-31 17:23:39,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:23:39,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-31 17:23:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:39,163 INFO L225 Difference]: With dead ends: 7697 [2018-12-31 17:23:39,168 INFO L226 Difference]: Without dead ends: 7556 [2018-12-31 17:23:39,169 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 [2018-12-31 17:23:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2018-12-31 17:23:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 7328. [2018-12-31 17:23:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7328 states. [2018-12-31 17:23:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7328 states to 7328 states and 19608 transitions. [2018-12-31 17:23:39,489 INFO L78 Accepts]: Start accepts. Automaton has 7328 states and 19608 transitions. Word has length 50 [2018-12-31 17:23:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:39,490 INFO L480 AbstractCegarLoop]: Abstraction has 7328 states and 19608 transitions. [2018-12-31 17:23:39,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:23:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 7328 states and 19608 transitions. [2018-12-31 17:23:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 17:23:39,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:39,495 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] [2018-12-31 17:23:39,496 INFO L423 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2124015952, now seen corresponding path program 1 times [2018-12-31 17:23:39,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:39,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:39,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:39,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:39,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:39,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:39,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 17:23:39,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 17:23:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 17:23:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 17:23:39,711 INFO L87 Difference]: Start difference. First operand 7328 states and 19608 transitions. Second operand 4 states. [2018-12-31 17:23:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:39,908 INFO L93 Difference]: Finished difference Result 10193 states and 27211 transitions. [2018-12-31 17:23:39,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 17:23:39,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-31 17:23:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:39,937 INFO L225 Difference]: With dead ends: 10193 [2018-12-31 17:23:39,937 INFO L226 Difference]: Without dead ends: 10193 [2018-12-31 17:23:39,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 17:23:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2018-12-31 17:23:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 7652. [2018-12-31 17:23:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7652 states. [2018-12-31 17:23:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 20475 transitions. [2018-12-31 17:23:40,191 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 20475 transitions. Word has length 55 [2018-12-31 17:23:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:40,191 INFO L480 AbstractCegarLoop]: Abstraction has 7652 states and 20475 transitions. [2018-12-31 17:23:40,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 17:23:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 20475 transitions. [2018-12-31 17:23:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 17:23:40,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:40,202 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] [2018-12-31 17:23:40,202 INFO L423 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1863469886, now seen corresponding path program 1 times [2018-12-31 17:23:40,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:40,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:40,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:40,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:40,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:40,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:23:40,486 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 [2018-12-31 17:23:40,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:40,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:23:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 17:23:40,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-31 17:23:40,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:23:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:23:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:23:40,841 INFO L87 Difference]: Start difference. First operand 7652 states and 20475 transitions. Second operand 7 states. [2018-12-31 17:23:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:41,455 INFO L93 Difference]: Finished difference Result 11186 states and 29819 transitions. [2018-12-31 17:23:41,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 17:23:41,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-12-31 17:23:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:41,485 INFO L225 Difference]: With dead ends: 11186 [2018-12-31 17:23:41,485 INFO L226 Difference]: Without dead ends: 11186 [2018-12-31 17:23:41,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 17:23:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11186 states. [2018-12-31 17:23:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11186 to 9716. [2018-12-31 17:23:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9716 states. [2018-12-31 17:23:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9716 states to 9716 states and 26036 transitions. [2018-12-31 17:23:41,737 INFO L78 Accepts]: Start accepts. Automaton has 9716 states and 26036 transitions. Word has length 78 [2018-12-31 17:23:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:41,738 INFO L480 AbstractCegarLoop]: Abstraction has 9716 states and 26036 transitions. [2018-12-31 17:23:41,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:23:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9716 states and 26036 transitions. [2018-12-31 17:23:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 17:23:41,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:41,750 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] [2018-12-31 17:23:41,750 INFO L423 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:41,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:41,751 INFO L82 PathProgramCache]: Analyzing trace with hash -598780544, now seen corresponding path program 1 times [2018-12-31 17:23:41,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:41,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:41,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:41,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:23:41,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:23:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:23:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:23:41,861 INFO L87 Difference]: Start difference. First operand 9716 states and 26036 transitions. Second operand 3 states. [2018-12-31 17:23:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:41,910 INFO L93 Difference]: Finished difference Result 4949 states and 12535 transitions. [2018-12-31 17:23:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:23:41,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-31 17:23:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:41,933 INFO L225 Difference]: With dead ends: 4949 [2018-12-31 17:23:41,933 INFO L226 Difference]: Without dead ends: 4949 [2018-12-31 17:23:41,933 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 [2018-12-31 17:23:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2018-12-31 17:23:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4844. [2018-12-31 17:23:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4844 states. [2018-12-31 17:23:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 12270 transitions. [2018-12-31 17:23:42,039 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 12270 transitions. Word has length 82 [2018-12-31 17:23:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:42,040 INFO L480 AbstractCegarLoop]: Abstraction has 4844 states and 12270 transitions. [2018-12-31 17:23:42,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:23:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 12270 transitions. [2018-12-31 17:23:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 17:23:42,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:42,154 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] [2018-12-31 17:23:42,155 INFO L423 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:42,155 INFO L82 PathProgramCache]: Analyzing trace with hash 675060464, now seen corresponding path program 1 times [2018-12-31 17:23:42,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:42,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:42,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:42,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 17:23:42,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:23:42,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:23:42,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:23:42,581 INFO L87 Difference]: Start difference. First operand 4844 states and 12270 transitions. Second operand 7 states. [2018-12-31 17:23:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:43,215 INFO L93 Difference]: Finished difference Result 6383 states and 16124 transitions. [2018-12-31 17:23:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:23:43,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-31 17:23:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:43,228 INFO L225 Difference]: With dead ends: 6383 [2018-12-31 17:23:43,228 INFO L226 Difference]: Without dead ends: 6383 [2018-12-31 17:23:43,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-31 17:23:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2018-12-31 17:23:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 5249. [2018-12-31 17:23:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5249 states. [2018-12-31 17:23:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 13264 transitions. [2018-12-31 17:23:43,331 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 13264 transitions. Word has length 83 [2018-12-31 17:23:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:43,332 INFO L480 AbstractCegarLoop]: Abstraction has 5249 states and 13264 transitions. [2018-12-31 17:23:43,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:23:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 13264 transitions. [2018-12-31 17:23:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:23:43,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:43,343 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] [2018-12-31 17:23:43,343 INFO L423 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:43,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1218020344, now seen corresponding path program 1 times [2018-12-31 17:23:43,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:43,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:43,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:44,103 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-31 17:23:44,295 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-31 17:23:44,814 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2018-12-31 17:23:45,209 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-12-31 17:23:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:46,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:46,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:23:46,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:23:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:23:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:23:46,038 INFO L87 Difference]: Start difference. First operand 5249 states and 13264 transitions. Second operand 18 states. [2018-12-31 17:23:46,690 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-12-31 17:23:47,176 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2018-12-31 17:23:47,345 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2018-12-31 17:23:48,087 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 17:23:48,705 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-31 17:23:49,045 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-31 17:23:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:49,519 INFO L93 Difference]: Finished difference Result 11875 states and 30174 transitions. [2018-12-31 17:23:49,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 17:23:49,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-12-31 17:23:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:49,537 INFO L225 Difference]: With dead ends: 11875 [2018-12-31 17:23:49,537 INFO L226 Difference]: Without dead ends: 11875 [2018-12-31 17:23:49,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 17:23:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2018-12-31 17:23:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 7443. [2018-12-31 17:23:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7443 states. [2018-12-31 17:23:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 19054 transitions. [2018-12-31 17:23:49,704 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 19054 transitions. Word has length 93 [2018-12-31 17:23:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:49,704 INFO L480 AbstractCegarLoop]: Abstraction has 7443 states and 19054 transitions. [2018-12-31 17:23:49,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:23:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 19054 transitions. [2018-12-31 17:23:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:23:49,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:49,718 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] [2018-12-31 17:23:49,718 INFO L423 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2057552392, now seen corresponding path program 2 times [2018-12-31 17:23:49,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:49,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:49,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:49,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:49,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:50,517 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-12-31 17:23:50,747 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-12-31 17:23:51,193 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2018-12-31 17:23:51,386 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 26 [2018-12-31 17:23:51,534 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2018-12-31 17:23:52,176 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2018-12-31 17:23:52,662 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 20 [2018-12-31 17:23:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:52,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:52,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:23:52,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:23:52,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:23:52,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:23:52,983 INFO L87 Difference]: Start difference. First operand 7443 states and 19054 transitions. Second operand 18 states. [2018-12-31 17:23:54,201 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-12-31 17:23:54,669 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-31 17:23:55,222 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-12-31 17:23:55,801 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2018-12-31 17:23:56,313 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-31 17:23:56,830 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-31 17:23:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:57,608 INFO L93 Difference]: Finished difference Result 16959 states and 43556 transitions. [2018-12-31 17:23:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 17:23:57,609 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-12-31 17:23:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:57,633 INFO L225 Difference]: With dead ends: 16959 [2018-12-31 17:23:57,633 INFO L226 Difference]: Without dead ends: 16959 [2018-12-31 17:23:57,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-12-31 17:23:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16959 states. [2018-12-31 17:23:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16959 to 7103. [2018-12-31 17:23:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7103 states. [2018-12-31 17:23:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7103 states to 7103 states and 18097 transitions. [2018-12-31 17:23:57,820 INFO L78 Accepts]: Start accepts. Automaton has 7103 states and 18097 transitions. Word has length 93 [2018-12-31 17:23:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:57,821 INFO L480 AbstractCegarLoop]: Abstraction has 7103 states and 18097 transitions. [2018-12-31 17:23:57,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:23:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 7103 states and 18097 transitions. [2018-12-31 17:23:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-31 17:23:57,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:57,841 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] [2018-12-31 17:23:57,841 INFO L423 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1004694727, now seen corresponding path program 2 times [2018-12-31 17:23:57,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:57,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:58,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:23:58,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-31 17:23:58,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 17:23:58,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 17:23:58,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 17:23:58,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:23:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:58,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 17:23:58,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-12-31 17:23:58,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 17:23:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 17:23:58,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-31 17:23:58,408 INFO L87 Difference]: Start difference. First operand 7103 states and 18097 transitions. Second operand 9 states. [2018-12-31 17:23:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:58,517 INFO L93 Difference]: Finished difference Result 9956 states and 25242 transitions. [2018-12-31 17:23:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:23:58,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-12-31 17:23:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:58,529 INFO L225 Difference]: With dead ends: 9956 [2018-12-31 17:23:58,530 INFO L226 Difference]: Without dead ends: 9956 [2018-12-31 17:23:58,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-31 17:23:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2018-12-31 17:23:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 8636. [2018-12-31 17:23:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2018-12-31 17:23:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 22048 transitions. [2018-12-31 17:23:58,683 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 22048 transitions. Word has length 110 [2018-12-31 17:23:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:58,683 INFO L480 AbstractCegarLoop]: Abstraction has 8636 states and 22048 transitions. [2018-12-31 17:23:58,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 17:23:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 22048 transitions. [2018-12-31 17:23:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-31 17:23:58,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:58,699 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] [2018-12-31 17:23:58,699 INFO L423 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -878541265, now seen corresponding path program 1 times [2018-12-31 17:23:58,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:58,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:58,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:23:59,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:23:59,054 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 [2018-12-31 17:23:59,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:59,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:23:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 17:23:59,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 17:23:59,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-12-31 17:23:59,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 17:23:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 17:23:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 17:23:59,298 INFO L87 Difference]: Start difference. First operand 8636 states and 22048 transitions. Second operand 8 states. [2018-12-31 17:23:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:59,514 INFO L93 Difference]: Finished difference Result 11783 states and 29878 transitions. [2018-12-31 17:23:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 17:23:59,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-12-31 17:23:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:59,529 INFO L225 Difference]: With dead ends: 11783 [2018-12-31 17:23:59,529 INFO L226 Difference]: Without dead ends: 11783 [2018-12-31 17:23:59,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-31 17:23:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11783 states. [2018-12-31 17:23:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11783 to 9566. [2018-12-31 17:23:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9566 states. [2018-12-31 17:23:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9566 states to 9566 states and 24603 transitions. [2018-12-31 17:23:59,670 INFO L78 Accepts]: Start accepts. Automaton has 9566 states and 24603 transitions. Word has length 115 [2018-12-31 17:23:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:59,671 INFO L480 AbstractCegarLoop]: Abstraction has 9566 states and 24603 transitions. [2018-12-31 17:23:59,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 17:23:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9566 states and 24603 transitions. [2018-12-31 17:23:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-31 17:23:59,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:59,683 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] [2018-12-31 17:23:59,683 INFO L423 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1478973223, now seen corresponding path program 1 times [2018-12-31 17:23:59,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:00,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:24:00,448 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 [2018-12-31 17:24:00,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:00,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:24:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:00,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 17:24:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2018-12-31 17:24:00,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 17:24:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 17:24:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-31 17:24:00,747 INFO L87 Difference]: Start difference. First operand 9566 states and 24603 transitions. Second operand 11 states. [2018-12-31 17:24:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:00,991 INFO L93 Difference]: Finished difference Result 11693 states and 29799 transitions. [2018-12-31 17:24:00,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 17:24:00,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-12-31 17:24:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:01,005 INFO L225 Difference]: With dead ends: 11693 [2018-12-31 17:24:01,005 INFO L226 Difference]: Without dead ends: 11693 [2018-12-31 17:24:01,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-12-31 17:24:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11693 states. [2018-12-31 17:24:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11693 to 9695. [2018-12-31 17:24:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9695 states. [2018-12-31 17:24:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9695 states to 9695 states and 24960 transitions. [2018-12-31 17:24:01,137 INFO L78 Accepts]: Start accepts. Automaton has 9695 states and 24960 transitions. Word has length 115 [2018-12-31 17:24:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:01,137 INFO L480 AbstractCegarLoop]: Abstraction has 9695 states and 24960 transitions. [2018-12-31 17:24:01,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 17:24:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 9695 states and 24960 transitions. [2018-12-31 17:24:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 17:24:01,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:01,149 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] [2018-12-31 17:24:01,150 INFO L423 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:01,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash 482584338, now seen corresponding path program 1 times [2018-12-31 17:24:01,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:01,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 17:24:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 17:24:01,289 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 17:24:01,401 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 17:24:01,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:24:01 BasicIcfg [2018-12-31 17:24:01,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 17:24:01,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 17:24:01,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 17:24:01,404 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 17:24:01,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:23:36" (3/4) ... [2018-12-31 17:24:01,409 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 17:24:01,536 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 17:24:01,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 17:24:01,540 INFO L168 Benchmark]: Toolchain (without parser) took 26964.33 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 541.6 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -64.4 MB). Peak memory consumption was 477.2 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:01,541 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 17:24:01,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1091.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:01,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.98 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. [2018-12-31 17:24:01,543 INFO L168 Benchmark]: Boogie Preprocessor took 63.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:01,545 INFO L168 Benchmark]: RCFGBuilder took 906.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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:01,545 INFO L168 Benchmark]: TraceAbstraction took 24671.46 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.9 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:01,546 INFO L168 Benchmark]: Witness Printer took 132.70 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:01,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1091.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.98 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 63.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 906.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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24671.46 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.9 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. * Witness Printer took 132.70 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 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, 24.4s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 11.0s 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.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 435 SyntacticMatches, 13 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 13.3s 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, 9.1s 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...