./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 91b1670e 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-91b1670 [2018-11-28 19:34:11,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:34:11,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:34:11,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:34:11,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:34:11,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:34:11,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:34:11,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:34:11,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:34:11,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:34:11,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:34:11,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:34:11,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:34:11,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:34:11,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:34:11,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:34:11,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:34:11,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:34:11,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:34:11,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:34:11,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:34:11,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:34:11,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:34:11,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:34:11,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:34:11,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:34:11,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:34:11,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:34:11,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:34:11,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:34:11,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:34:11,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:34:11,200 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:34:11,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:34:11,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:34:11,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:34:11,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 19:34:11,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:34:11,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:34:11,220 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:34:11,220 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:34:11,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:34:11,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:34:11,222 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:34:11,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:34:11,222 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:34:11,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:34:11,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:34:11,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:34:11,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:34:11,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:34:11,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:34:11,225 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:34:11,225 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:34:11,225 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:34:11,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:34:11,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:34:11,226 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:34:11,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:34:11,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:34:11,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:34:11,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:34:11,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:34:11,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:34:11,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:34:11,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:34:11,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:34:11,229 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-11-28 19:34:11,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:34:11,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:34:11,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:34:11,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:34:11,287 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:34:11,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/stack_longer_false-unreach-call.i [2018-11-28 19:34:11,357 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af380f093/25182dd6ac174465ad2e995eede04481/FLAG02234876d [2018-11-28 19:34:11,928 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:34:11,929 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/stack_longer_false-unreach-call.i [2018-11-28 19:34:11,948 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af380f093/25182dd6ac174465ad2e995eede04481/FLAG02234876d [2018-11-28 19:34:12,180 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af380f093/25182dd6ac174465ad2e995eede04481 [2018-11-28 19:34:12,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:34:12,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:34:12,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:34:12,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:34:12,190 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:34:12,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:34:12" (1/1) ... [2018-11-28 19:34:12,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a81771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:12, skipping insertion in model container [2018-11-28 19:34:12,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:34:12" (1/1) ... [2018-11-28 19:34:12,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:34:12,255 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:34:12,840 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:34:12,902 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:34:13,036 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:34:13,207 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:34:13,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13 WrapperNode [2018-11-28 19:34:13,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:34:13,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:34:13,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:34:13,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:34:13,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:34:13,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:34:13,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:34:13,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:34:13,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (1/1) ... [2018-11-28 19:34:13,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:34:13,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:34:13,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:34:13,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:34:13,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (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-11-28 19:34:13,424 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2018-11-28 19:34:13,424 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2018-11-28 19:34:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2018-11-28 19:34:13,425 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2018-11-28 19:34:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:34:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 19:34:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:34:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 19:34:13,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:34:13,426 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2018-11-28 19:34:13,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 19:34:13,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:34:13,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:34:13,429 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 19:34:14,352 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:34:14,352 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-11-28 19:34:14,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:34:14 BoogieIcfgContainer [2018-11-28 19:34:14,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:34:14,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:34:14,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:34:14,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:34:14,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:34:12" (1/3) ... [2018-11-28 19:34:14,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab130b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:34:14, skipping insertion in model container [2018-11-28 19:34:14,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:34:13" (2/3) ... [2018-11-28 19:34:14,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab130b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:34:14, skipping insertion in model container [2018-11-28 19:34:14,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:34:14" (3/3) ... [2018-11-28 19:34:14,362 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer_false-unreach-call.i [2018-11-28 19:34:14,405 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,406 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,406 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,406 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,406 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,407 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,407 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,407 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,407 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,409 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,409 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,409 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,410 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,411 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,411 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,412 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,412 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,412 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,415 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,416 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,416 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,418 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,419 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,421 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,421 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,421 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,422 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,422 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,422 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,424 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,426 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,426 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,427 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,433 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,433 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:34:14,476 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:34:14,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:34:14,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-28 19:34:14,502 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-28 19:34:14,532 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:34:14,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:34:14,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:34:14,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:34:14,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:34:14,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:34:14,534 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:34:14,534 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:34:14,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:34:14,551 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 139 transitions [2018-11-28 19:34:14,829 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6506 states. [2018-11-28 19:34:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states. [2018-11-28 19:34:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 19:34:14,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:14,878 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-11-28 19:34:14,880 INFO L423 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:14,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:14,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1331807669, now seen corresponding path program 1 times [2018-11-28 19:34:14,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:14,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:14,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:14,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:14,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:15,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:34:15,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:34:15,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:34:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:34:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:34:15,383 INFO L87 Difference]: Start difference. First operand 6506 states. Second operand 3 states. [2018-11-28 19:34:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:15,655 INFO L93 Difference]: Finished difference Result 9854 states and 26353 transitions. [2018-11-28 19:34:15,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:34:15,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-28 19:34:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:15,746 INFO L225 Difference]: With dead ends: 9854 [2018-11-28 19:34:15,746 INFO L226 Difference]: Without dead ends: 9746 [2018-11-28 19:34:15,748 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-11-28 19:34:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2018-11-28 19:34:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8276. [2018-11-28 19:34:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2018-11-28 19:34:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 22334 transitions. [2018-11-28 19:34:16,190 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 22334 transitions. Word has length 46 [2018-11-28 19:34:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:16,191 INFO L480 AbstractCegarLoop]: Abstraction has 8276 states and 22334 transitions. [2018-11-28 19:34:16,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:34:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 22334 transitions. [2018-11-28 19:34:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 19:34:16,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:16,202 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-11-28 19:34:16,202 INFO L423 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:16,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash 650392225, now seen corresponding path program 1 times [2018-11-28 19:34:16,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:16,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:16,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:16,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:16,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:34:16,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:34:16,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:34:16,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:34:16,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:34:16,407 INFO L87 Difference]: Start difference. First operand 8276 states and 22334 transitions. Second operand 3 states. [2018-11-28 19:34:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:16,597 INFO L93 Difference]: Finished difference Result 7697 states and 20469 transitions. [2018-11-28 19:34:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:34:16,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 19:34:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:16,664 INFO L225 Difference]: With dead ends: 7697 [2018-11-28 19:34:16,664 INFO L226 Difference]: Without dead ends: 7556 [2018-11-28 19:34:16,665 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-11-28 19:34:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2018-11-28 19:34:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 7328. [2018-11-28 19:34:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7328 states. [2018-11-28 19:34:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7328 states to 7328 states and 19608 transitions. [2018-11-28 19:34:17,036 INFO L78 Accepts]: Start accepts. Automaton has 7328 states and 19608 transitions. Word has length 50 [2018-11-28 19:34:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:17,040 INFO L480 AbstractCegarLoop]: Abstraction has 7328 states and 19608 transitions. [2018-11-28 19:34:17,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:34:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 7328 states and 19608 transitions. [2018-11-28 19:34:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 19:34:17,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:17,045 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-11-28 19:34:17,045 INFO L423 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:17,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2124015952, now seen corresponding path program 1 times [2018-11-28 19:34:17,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:17,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:17,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:17,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:17,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:34:17,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:34:17,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:34:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:34:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:34:17,200 INFO L87 Difference]: Start difference. First operand 7328 states and 19608 transitions. Second operand 4 states. [2018-11-28 19:34:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:17,582 INFO L93 Difference]: Finished difference Result 10193 states and 27211 transitions. [2018-11-28 19:34:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:34:17,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-28 19:34:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:17,613 INFO L225 Difference]: With dead ends: 10193 [2018-11-28 19:34:17,613 INFO L226 Difference]: Without dead ends: 10193 [2018-11-28 19:34:17,614 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-11-28 19:34:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2018-11-28 19:34:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 7652. [2018-11-28 19:34:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7652 states. [2018-11-28 19:34:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 20475 transitions. [2018-11-28 19:34:17,852 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 20475 transitions. Word has length 55 [2018-11-28 19:34:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:17,853 INFO L480 AbstractCegarLoop]: Abstraction has 7652 states and 20475 transitions. [2018-11-28 19:34:17,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:34:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 20475 transitions. [2018-11-28 19:34:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 19:34:17,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:17,864 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-11-28 19:34:17,864 INFO L423 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:17,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1863469886, now seen corresponding path program 1 times [2018-11-28 19:34:17,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:17,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:17,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:17,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:18,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 19:34:18,184 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-11-28 19:34:18,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:18,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 19:34:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:18,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 19:34:18,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 19:34:18,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:34:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:34:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:34:18,630 INFO L87 Difference]: Start difference. First operand 7652 states and 20475 transitions. Second operand 7 states. [2018-11-28 19:34:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:19,394 INFO L93 Difference]: Finished difference Result 11186 states and 29819 transitions. [2018-11-28 19:34:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:34:19,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-11-28 19:34:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:19,426 INFO L225 Difference]: With dead ends: 11186 [2018-11-28 19:34:19,427 INFO L226 Difference]: Without dead ends: 11186 [2018-11-28 19:34:19,427 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-11-28 19:34:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11186 states. [2018-11-28 19:34:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11186 to 9716. [2018-11-28 19:34:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9716 states. [2018-11-28 19:34:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9716 states to 9716 states and 26036 transitions. [2018-11-28 19:34:19,713 INFO L78 Accepts]: Start accepts. Automaton has 9716 states and 26036 transitions. Word has length 78 [2018-11-28 19:34:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:19,713 INFO L480 AbstractCegarLoop]: Abstraction has 9716 states and 26036 transitions. [2018-11-28 19:34:19,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:34:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 9716 states and 26036 transitions. [2018-11-28 19:34:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 19:34:19,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:19,725 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-11-28 19:34:19,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:19,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash -598780544, now seen corresponding path program 1 times [2018-11-28 19:34:19,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:19,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:19,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:34:19,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:34:19,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:34:19,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:34:19,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:34:19,848 INFO L87 Difference]: Start difference. First operand 9716 states and 26036 transitions. Second operand 3 states. [2018-11-28 19:34:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:19,959 INFO L93 Difference]: Finished difference Result 4949 states and 12535 transitions. [2018-11-28 19:34:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:34:19,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-11-28 19:34:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:19,972 INFO L225 Difference]: With dead ends: 4949 [2018-11-28 19:34:19,972 INFO L226 Difference]: Without dead ends: 4949 [2018-11-28 19:34:19,972 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-11-28 19:34:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2018-11-28 19:34:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4844. [2018-11-28 19:34:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4844 states. [2018-11-28 19:34:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 12270 transitions. [2018-11-28 19:34:20,086 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 12270 transitions. Word has length 82 [2018-11-28 19:34:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:20,086 INFO L480 AbstractCegarLoop]: Abstraction has 4844 states and 12270 transitions. [2018-11-28 19:34:20,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:34:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 12270 transitions. [2018-11-28 19:34:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 19:34:20,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:20,096 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-11-28 19:34:20,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:20,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 675060464, now seen corresponding path program 1 times [2018-11-28 19:34:20,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:20,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:20,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:20,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:20,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:34:20,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:34:20,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:34:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:34:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:34:20,557 INFO L87 Difference]: Start difference. First operand 4844 states and 12270 transitions. Second operand 7 states. [2018-11-28 19:34:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:21,164 INFO L93 Difference]: Finished difference Result 6383 states and 16124 transitions. [2018-11-28 19:34:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:34:21,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-28 19:34:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:21,178 INFO L225 Difference]: With dead ends: 6383 [2018-11-28 19:34:21,179 INFO L226 Difference]: Without dead ends: 6383 [2018-11-28 19:34:21,179 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-11-28 19:34:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2018-11-28 19:34:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 5249. [2018-11-28 19:34:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5249 states. [2018-11-28 19:34:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 13264 transitions. [2018-11-28 19:34:21,285 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 13264 transitions. Word has length 83 [2018-11-28 19:34:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:21,285 INFO L480 AbstractCegarLoop]: Abstraction has 5249 states and 13264 transitions. [2018-11-28 19:34:21,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:34:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 13264 transitions. [2018-11-28 19:34:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:34:21,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:21,296 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-11-28 19:34:21,296 INFO L423 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:21,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1218020344, now seen corresponding path program 1 times [2018-11-28 19:34:21,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:21,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:21,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:21,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:21,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:22,082 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-28 19:34:22,373 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2018-11-28 19:34:22,742 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-11-28 19:34:23,502 WARN L180 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2018-11-28 19:34:23,640 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2018-11-28 19:34:23,774 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2018-11-28 19:34:23,978 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2018-11-28 19:34:24,682 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2018-11-28 19:34:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:25,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:34:25,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 19:34:25,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 19:34:25,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 19:34:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-28 19:34:25,439 INFO L87 Difference]: Start difference. First operand 5249 states and 13264 transitions. Second operand 18 states. [2018-11-28 19:34:26,421 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2018-11-28 19:34:26,634 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2018-11-28 19:34:28,069 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-28 19:34:28,414 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-28 19:34:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:28,973 INFO L93 Difference]: Finished difference Result 11875 states and 30174 transitions. [2018-11-28 19:34:28,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 19:34:28,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-11-28 19:34:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:28,997 INFO L225 Difference]: With dead ends: 11875 [2018-11-28 19:34:28,997 INFO L226 Difference]: Without dead ends: 11875 [2018-11-28 19:34:28,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 19:34:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2018-11-28 19:34:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 7443. [2018-11-28 19:34:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7443 states. [2018-11-28 19:34:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 19054 transitions. [2018-11-28 19:34:29,181 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 19054 transitions. Word has length 93 [2018-11-28 19:34:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:29,182 INFO L480 AbstractCegarLoop]: Abstraction has 7443 states and 19054 transitions. [2018-11-28 19:34:29,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 19:34:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 19054 transitions. [2018-11-28 19:34:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 19:34:29,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:29,195 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-11-28 19:34:29,196 INFO L423 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2057552392, now seen corresponding path program 2 times [2018-11-28 19:34:29,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:29,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:30,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:34:30,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 19:34:30,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 19:34:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 19:34:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-11-28 19:34:30,309 INFO L87 Difference]: Start difference. First operand 7443 states and 19054 transitions. Second operand 21 states. [2018-11-28 19:34:31,809 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-28 19:34:32,007 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-28 19:34:32,212 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-28 19:34:32,447 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-28 19:34:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:33,013 INFO L93 Difference]: Finished difference Result 14175 states and 36335 transitions. [2018-11-28 19:34:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 19:34:33,013 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-11-28 19:34:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:33,035 INFO L225 Difference]: With dead ends: 14175 [2018-11-28 19:34:33,035 INFO L226 Difference]: Without dead ends: 14175 [2018-11-28 19:34:33,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 19:34:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14175 states. [2018-11-28 19:34:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14175 to 7103. [2018-11-28 19:34:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7103 states. [2018-11-28 19:34:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7103 states to 7103 states and 18097 transitions. [2018-11-28 19:34:33,223 INFO L78 Accepts]: Start accepts. Automaton has 7103 states and 18097 transitions. Word has length 93 [2018-11-28 19:34:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:33,223 INFO L480 AbstractCegarLoop]: Abstraction has 7103 states and 18097 transitions. [2018-11-28 19:34:33,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 19:34:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7103 states and 18097 transitions. [2018-11-28 19:34:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-28 19:34:33,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:33,234 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-11-28 19:34:33,235 INFO L423 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:33,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1004694727, now seen corresponding path program 2 times [2018-11-28 19:34:33,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:33,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:33,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:34:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:33,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 19:34:33,524 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-11-28 19:34:33,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 19:34:33,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 19:34:33,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 19:34:33,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 19:34:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:33,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 19:34:33,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-28 19:34:33,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:34:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:34:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:34:33,748 INFO L87 Difference]: Start difference. First operand 7103 states and 18097 transitions. Second operand 9 states. [2018-11-28 19:34:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:33,866 INFO L93 Difference]: Finished difference Result 9956 states and 25242 transitions. [2018-11-28 19:34:33,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:34:33,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-11-28 19:34:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:33,887 INFO L225 Difference]: With dead ends: 9956 [2018-11-28 19:34:33,888 INFO L226 Difference]: Without dead ends: 9956 [2018-11-28 19:34:33,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:34:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2018-11-28 19:34:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 8636. [2018-11-28 19:34:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2018-11-28 19:34:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 22048 transitions. [2018-11-28 19:34:34,056 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 22048 transitions. Word has length 110 [2018-11-28 19:34:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:34,056 INFO L480 AbstractCegarLoop]: Abstraction has 8636 states and 22048 transitions. [2018-11-28 19:34:34,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:34:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 22048 transitions. [2018-11-28 19:34:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 19:34:34,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:34,071 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-11-28 19:34:34,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:34,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:34,072 INFO L82 PathProgramCache]: Analyzing trace with hash -878541265, now seen corresponding path program 1 times [2018-11-28 19:34:34,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:34,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:34,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:34:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:34,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 19:34:34,415 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-11-28 19:34:34,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:34,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 19:34:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 19:34:34,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 19:34:34,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-11-28 19:34:34,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 19:34:34,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 19:34:34,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:34:34,546 INFO L87 Difference]: Start difference. First operand 8636 states and 22048 transitions. Second operand 8 states. [2018-11-28 19:34:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:35,038 INFO L93 Difference]: Finished difference Result 11783 states and 29878 transitions. [2018-11-28 19:34:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:34:35,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-11-28 19:34:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:35,052 INFO L225 Difference]: With dead ends: 11783 [2018-11-28 19:34:35,052 INFO L226 Difference]: Without dead ends: 11783 [2018-11-28 19:34:35,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-28 19:34:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11783 states. [2018-11-28 19:34:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11783 to 9566. [2018-11-28 19:34:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9566 states. [2018-11-28 19:34:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9566 states to 9566 states and 24603 transitions. [2018-11-28 19:34:35,405 INFO L78 Accepts]: Start accepts. Automaton has 9566 states and 24603 transitions. Word has length 115 [2018-11-28 19:34:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:35,407 INFO L480 AbstractCegarLoop]: Abstraction has 9566 states and 24603 transitions. [2018-11-28 19:34:35,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 19:34:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9566 states and 24603 transitions. [2018-11-28 19:34:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 19:34:35,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:35,419 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-11-28 19:34:35,420 INFO L423 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:35,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1478973223, now seen corresponding path program 1 times [2018-11-28 19:34:35,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:35,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:35,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:35,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:36,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 19:34:36,021 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-11-28 19:34:36,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:34:36,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 19:34:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:34:36,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 19:34:36,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2018-11-28 19:34:36,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 19:34:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 19:34:36,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-28 19:34:36,188 INFO L87 Difference]: Start difference. First operand 9566 states and 24603 transitions. Second operand 11 states. [2018-11-28 19:34:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:34:36,409 INFO L93 Difference]: Finished difference Result 11693 states and 29799 transitions. [2018-11-28 19:34:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:34:36,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-11-28 19:34:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:34:36,423 INFO L225 Difference]: With dead ends: 11693 [2018-11-28 19:34:36,423 INFO L226 Difference]: Without dead ends: 11693 [2018-11-28 19:34:36,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-11-28 19:34:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11693 states. [2018-11-28 19:34:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11693 to 9695. [2018-11-28 19:34:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9695 states. [2018-11-28 19:34:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9695 states to 9695 states and 24960 transitions. [2018-11-28 19:34:36,567 INFO L78 Accepts]: Start accepts. Automaton has 9695 states and 24960 transitions. Word has length 115 [2018-11-28 19:34:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:34:36,567 INFO L480 AbstractCegarLoop]: Abstraction has 9695 states and 24960 transitions. [2018-11-28 19:34:36,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 19:34:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 9695 states and 24960 transitions. [2018-11-28 19:34:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-28 19:34:36,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:34:36,576 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-11-28 19:34:36,577 INFO L423 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:34:36,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:34:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash 482584338, now seen corresponding path program 1 times [2018-11-28 19:34:36,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:34:36,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:34:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:36,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:34:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:34:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:34:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:34:36,693 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:34:36,832 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:34:36,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:34:36 BasicIcfg [2018-11-28 19:34:36,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:34:36,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:34:36,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:34:36,836 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:34:36,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:34:14" (3/4) ... [2018-11-28 19:34:36,842 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:34:36,998 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:34:37,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:34:37,003 INFO L168 Benchmark]: Toolchain (without parser) took 24819.88 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 507.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. [2018-11-28 19:34:37,005 INFO L168 Benchmark]: CDTParser took 0.51 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-11-28 19:34:37,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1022.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-11-28 19:34:37,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.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-11-28 19:34:37,006 INFO L168 Benchmark]: Boogie Preprocessor took 45.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 19:34:37,015 INFO L168 Benchmark]: RCFGBuilder took 999.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-28 19:34:37,015 INFO L168 Benchmark]: TraceAbstraction took 22479.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.9 MB). Peak memory consumption was 284.3 MB. Max. memory is 11.5 GB. [2018-11-28 19:34:37,016 INFO L168 Benchmark]: Witness Printer took 166.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 19:34:37,022 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.51 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 1022.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.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 45.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 999.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22479.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.9 MB). Peak memory consumption was 284.3 MB. Max. memory is 11.5 GB. * Witness Printer took 166.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 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={4294967304:0}, top=0] [L916] -1 pthread_mutex_t m; VAL [arr={4294967304:0}, m={4294967307:0}, top=0] [L917] -1 _Bool flag=(0); VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L998] -1 pthread_t id1, id2; VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L1000] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L967] 0 int i; VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L968] 0 unsigned int tmp; VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L969] 0 i=0 VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L969] COND TRUE 0 i<(400) VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L1001] FCALL, FORK -1 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L983] 1 int i; VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L984] 1 i=0 VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L984] COND TRUE 1 i<(400) VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L972] 0 tmp = __VERIFIER_nondet_uint() VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L939] COND FALSE 0 !(top==(400)) VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L931] 0 return top; VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L946] 0 stack[get_top()] = x VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=0] [L923] 0 top++ VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=1] [L949] 0 return 0; VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=1] [L974] COND FALSE 0 !(push(arr,tmp)==(-1)) VAL [arr={4294967304:0}, flag=0, m={4294967307:0}, top=1] [L976] 0 flag=(1) VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=1] [L987] COND TRUE 1 \read(flag) VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=1] [L931] 1 return top; VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=1] [L953] COND FALSE 1 !(get_top()==0) VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=1] [L927] 1 top-- VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L931] 1 return top; VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L961] EXPR 1 stack[get_top()] VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L961] 1 return stack[get_top()]; VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L989] COND FALSE 1 !(!(pop(arr)!=(-2))) VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L984] 1 i++ VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L984] COND TRUE 1 i<(400) VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L987] COND TRUE 1 \read(flag) VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L931] 1 return top; VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L953] COND TRUE 1 get_top()==0 VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L956] 1 return (-2); VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L989] COND TRUE 1 !(pop(arr)!=(-2)) VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] [L919] 1 __VERIFIER_error() VAL [arr={4294967304:0}, flag=1, m={4294967307:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 4 error locations. UNSAFE Result, 22.3s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2073 SDtfs, 3804 SDslu, 10122 SDs, 0 SdLazy, 1732 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 431 SyntacticMatches, 10 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 10.9s 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.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 23987 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 920965 SizeOfPredicates, 20 NumberOfNonLiveVariables, 949 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...