./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_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 876454da50381170b67bfde0914077310251dbb9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 03:42:23,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:42:23,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:42:23,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:42:23,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:42:23,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:42:23,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:42:23,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:42:23,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:42:23,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:42:23,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:42:23,290 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:42:23,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:42:23,291 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:42:23,292 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:42:23,293 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:42:23,294 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:42:23,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:42:23,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:42:23,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:42:23,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:42:23,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:42:23,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:42:23,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:42:23,308 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:42:23,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:42:23,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:42:23,315 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:42:23,316 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:42:23,317 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:42:23,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:42:23,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:42:23,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:42:23,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:42:23,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:42:23,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:42:23,320 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:42:23,340 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:42:23,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:42:23,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:42:23,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:42:23,343 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:42:23,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:42:23,343 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:42:23,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:42:23,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:42:23,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:42:23,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:42:23,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:42:23,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:42:23,345 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:42:23,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:42:23,345 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:42:23,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:42:23,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:42:23,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:42:23,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:42:23,347 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:42:23,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:42:23,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:42:23,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:42:23,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:42:23,349 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:42:23,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:42:23,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:42:23,349 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 -> 876454da50381170b67bfde0914077310251dbb9 [2019-01-13 03:42:23,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:42:23,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:42:23,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:42:23,419 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:42:23,419 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:42:23,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i [2019-01-13 03:42:23,483 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b6c14ae/93a816e99f4a430eacf097600dc853d2/FLAG04f80b350 [2019-01-13 03:42:23,992 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:42:23,993 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i [2019-01-13 03:42:24,008 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b6c14ae/93a816e99f4a430eacf097600dc853d2/FLAG04f80b350 [2019-01-13 03:42:24,262 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b6c14ae/93a816e99f4a430eacf097600dc853d2 [2019-01-13 03:42:24,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:42:24,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:42:24,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:42:24,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:42:24,272 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:42:24,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:42:24" (1/1) ... [2019-01-13 03:42:24,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79626fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:24, skipping insertion in model container [2019-01-13 03:42:24,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:42:24" (1/1) ... [2019-01-13 03:42:24,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:42:24,345 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:42:24,868 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:42:24,891 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:42:25,102 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:42:25,190 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:42:25,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25 WrapperNode [2019-01-13 03:42:25,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:42:25,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:42:25,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:42:25,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:42:25,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:42:25,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:42:25,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:42:25,254 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:42:25,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... [2019-01-13 03:42:25,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:42:25,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:42:25,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:42:25,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:42:25,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:42:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:42:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:42:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:42:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:42:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:42:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:42:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:42:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:42:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:42:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:42:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:42:25,365 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:42:26,322 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:42:26,322 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:42:26,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:26 BoogieIcfgContainer [2019-01-13 03:42:26,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:42:26,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:42:26,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:42:26,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:42:26,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:42:24" (1/3) ... [2019-01-13 03:42:26,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53684517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:42:26, skipping insertion in model container [2019-01-13 03:42:26,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:25" (2/3) ... [2019-01-13 03:42:26,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53684517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:42:26, skipping insertion in model container [2019-01-13 03:42:26,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:26" (3/3) ... [2019-01-13 03:42:26,334 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt_false-unreach-call.i [2019-01-13 03:42:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,380 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,381 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,399 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,404 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,404 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,404 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,404 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,405 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,405 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:26,438 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:42:26,439 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:42:26,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:42:26,466 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:42:26,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:42:26,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:42:26,496 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:42:26,496 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:42:26,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:42:26,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:42:26,498 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:42:26,498 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:42:26,498 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:42:26,517 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2019-01-13 03:42:28,662 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2019-01-13 03:42:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2019-01-13 03:42:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 03:42:28,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:28,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:28,678 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:28,686 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2019-01-13 03:42:28,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:28,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:28,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:28,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:29,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:29,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:29,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:29,055 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2019-01-13 03:42:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:30,093 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2019-01-13 03:42:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:42:30,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-13 03:42:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:30,410 INFO L225 Difference]: With dead ends: 47768 [2019-01-13 03:42:30,410 INFO L226 Difference]: Without dead ends: 34608 [2019-01-13 03:42:30,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2019-01-13 03:42:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2019-01-13 03:42:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2019-01-13 03:42:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2019-01-13 03:42:31,968 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2019-01-13 03:42:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:31,971 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2019-01-13 03:42:31,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2019-01-13 03:42:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 03:42:31,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:31,990 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] [2019-01-13 03:42:31,990 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2019-01-13 03:42:31,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:32,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:32,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:32,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:32,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:32,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:32,166 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2019-01-13 03:42:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:35,275 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2019-01-13 03:42:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:35,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 03:42:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:35,724 INFO L225 Difference]: With dead ends: 47634 [2019-01-13 03:42:35,725 INFO L226 Difference]: Without dead ends: 47066 [2019-01-13 03:42:35,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2019-01-13 03:42:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2019-01-13 03:42:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2019-01-13 03:42:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2019-01-13 03:42:37,396 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2019-01-13 03:42:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:37,397 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2019-01-13 03:42:37,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2019-01-13 03:42:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 03:42:37,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:37,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:37,404 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2019-01-13 03:42:37,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:37,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:37,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:37,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:37,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:37,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:37,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:37,538 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2019-01-13 03:42:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:38,264 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2019-01-13 03:42:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:38,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-13 03:42:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:38,453 INFO L225 Difference]: With dead ends: 63028 [2019-01-13 03:42:38,453 INFO L226 Difference]: Without dead ends: 62564 [2019-01-13 03:42:38,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2019-01-13 03:42:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2019-01-13 03:42:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2019-01-13 03:42:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2019-01-13 03:42:40,392 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2019-01-13 03:42:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:40,393 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2019-01-13 03:42:40,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2019-01-13 03:42:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 03:42:40,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:40,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:40,402 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2019-01-13 03:42:40,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:40,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:40,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:42:40,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:42:40,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:42:40,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:40,484 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2019-01-13 03:42:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:40,716 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2019-01-13 03:42:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:42:40,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-13 03:42:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:40,816 INFO L225 Difference]: With dead ends: 45910 [2019-01-13 03:42:40,816 INFO L226 Difference]: Without dead ends: 45910 [2019-01-13 03:42:40,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2019-01-13 03:42:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2019-01-13 03:42:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2019-01-13 03:42:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2019-01-13 03:42:42,831 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2019-01-13 03:42:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:42,832 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2019-01-13 03:42:42,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:42:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2019-01-13 03:42:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:42,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:42,853 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] [2019-01-13 03:42:42,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2019-01-13 03:42:42,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:42,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:42,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:43,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:43,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:43,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:43,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:43,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:43,032 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2019-01-13 03:42:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:44,112 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2019-01-13 03:42:44,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:42:44,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 03:42:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:44,267 INFO L225 Difference]: With dead ends: 70850 [2019-01-13 03:42:44,267 INFO L226 Difference]: Without dead ends: 70314 [2019-01-13 03:42:44,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:42:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2019-01-13 03:42:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2019-01-13 03:42:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2019-01-13 03:42:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2019-01-13 03:42:45,246 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2019-01-13 03:42:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:45,246 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2019-01-13 03:42:45,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2019-01-13 03:42:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:45,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:45,262 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] [2019-01-13 03:42:45,262 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:45,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1915358571, now seen corresponding path program 1 times [2019-01-13 03:42:45,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:45,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:45,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:45,810 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 03:42:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:45,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:45,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:45,866 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2019-01-13 03:42:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:46,976 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2019-01-13 03:42:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:46,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 03:42:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:49,911 INFO L225 Difference]: With dead ends: 56599 [2019-01-13 03:42:49,912 INFO L226 Difference]: Without dead ends: 55460 [2019-01-13 03:42:49,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2019-01-13 03:42:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2019-01-13 03:42:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2019-01-13 03:42:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2019-01-13 03:42:51,072 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2019-01-13 03:42:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:51,072 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2019-01-13 03:42:51,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2019-01-13 03:42:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:51,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:51,088 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] [2019-01-13 03:42:51,088 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:51,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash 582657366, now seen corresponding path program 1 times [2019-01-13 03:42:51,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:51,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:51,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:51,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:51,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:51,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:51,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:51,387 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2019-01-13 03:42:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:52,757 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2019-01-13 03:42:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:42:52,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-13 03:42:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:52,926 INFO L225 Difference]: With dead ends: 75638 [2019-01-13 03:42:52,926 INFO L226 Difference]: Without dead ends: 75638 [2019-01-13 03:42:52,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:42:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2019-01-13 03:42:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2019-01-13 03:42:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2019-01-13 03:42:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2019-01-13 03:42:54,739 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2019-01-13 03:42:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:54,739 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2019-01-13 03:42:54,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2019-01-13 03:42:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:54,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:54,754 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] [2019-01-13 03:42:54,755 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1470161047, now seen corresponding path program 1 times [2019-01-13 03:42:54,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:54,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:54,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:54,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:54,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:54,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:54,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:54,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:54,852 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 4 states. [2019-01-13 03:42:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:54,925 INFO L93 Difference]: Finished difference Result 13778 states and 43274 transitions. [2019-01-13 03:42:54,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:54,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-13 03:42:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:54,947 INFO L225 Difference]: With dead ends: 13778 [2019-01-13 03:42:54,947 INFO L226 Difference]: Without dead ends: 12161 [2019-01-13 03:42:54,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12161 states. [2019-01-13 03:42:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12161 to 12113. [2019-01-13 03:42:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12113 states. [2019-01-13 03:42:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 37958 transitions. [2019-01-13 03:42:55,123 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 37958 transitions. Word has length 54 [2019-01-13 03:42:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:55,124 INFO L480 AbstractCegarLoop]: Abstraction has 12113 states and 37958 transitions. [2019-01-13 03:42:55,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 37958 transitions. [2019-01-13 03:42:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:42:55,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:55,131 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] [2019-01-13 03:42:55,131 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2019-01-13 03:42:55,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:55,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:55,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:55,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:55,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:55,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:55,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:55,358 INFO L87 Difference]: Start difference. First operand 12113 states and 37958 transitions. Second operand 4 states. [2019-01-13 03:42:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:55,798 INFO L93 Difference]: Finished difference Result 14276 states and 44581 transitions. [2019-01-13 03:42:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:55,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 03:42:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:55,822 INFO L225 Difference]: With dead ends: 14276 [2019-01-13 03:42:55,822 INFO L226 Difference]: Without dead ends: 14276 [2019-01-13 03:42:55,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14276 states. [2019-01-13 03:42:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14276 to 12844. [2019-01-13 03:42:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12844 states. [2019-01-13 03:42:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12844 states to 12844 states and 40183 transitions. [2019-01-13 03:42:56,004 INFO L78 Accepts]: Start accepts. Automaton has 12844 states and 40183 transitions. Word has length 64 [2019-01-13 03:42:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:56,004 INFO L480 AbstractCegarLoop]: Abstraction has 12844 states and 40183 transitions. [2019-01-13 03:42:56,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12844 states and 40183 transitions. [2019-01-13 03:42:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:42:56,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:56,012 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] [2019-01-13 03:42:56,012 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2019-01-13 03:42:56,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:56,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:56,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:56,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:56,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:56,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:56,406 INFO L87 Difference]: Start difference. First operand 12844 states and 40183 transitions. Second operand 6 states. [2019-01-13 03:42:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:57,569 INFO L93 Difference]: Finished difference Result 23411 states and 72792 transitions. [2019-01-13 03:42:57,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:42:57,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-13 03:42:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:57,614 INFO L225 Difference]: With dead ends: 23411 [2019-01-13 03:42:57,615 INFO L226 Difference]: Without dead ends: 23347 [2019-01-13 03:42:57,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:42:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23347 states. [2019-01-13 03:42:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23347 to 13813. [2019-01-13 03:42:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13813 states. [2019-01-13 03:42:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13813 states to 13813 states and 42967 transitions. [2019-01-13 03:42:57,899 INFO L78 Accepts]: Start accepts. Automaton has 13813 states and 42967 transitions. Word has length 64 [2019-01-13 03:42:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:57,900 INFO L480 AbstractCegarLoop]: Abstraction has 13813 states and 42967 transitions. [2019-01-13 03:42:57,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 13813 states and 42967 transitions. [2019-01-13 03:42:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:42:57,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:57,910 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] [2019-01-13 03:42:57,910 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2019-01-13 03:42:57,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:57,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:57,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:57,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:57,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:58,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:58,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:58,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:58,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:58,078 INFO L87 Difference]: Start difference. First operand 13813 states and 42967 transitions. Second operand 4 states. [2019-01-13 03:42:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:58,740 INFO L93 Difference]: Finished difference Result 20043 states and 60866 transitions. [2019-01-13 03:42:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:58,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 03:42:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:58,773 INFO L225 Difference]: With dead ends: 20043 [2019-01-13 03:42:58,773 INFO L226 Difference]: Without dead ends: 19971 [2019-01-13 03:42:58,774 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 [2019-01-13 03:42:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2019-01-13 03:42:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 15684. [2019-01-13 03:42:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15684 states. [2019-01-13 03:42:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15684 states to 15684 states and 48127 transitions. [2019-01-13 03:42:59,022 INFO L78 Accepts]: Start accepts. Automaton has 15684 states and 48127 transitions. Word has length 66 [2019-01-13 03:42:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:59,023 INFO L480 AbstractCegarLoop]: Abstraction has 15684 states and 48127 transitions. [2019-01-13 03:42:59,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15684 states and 48127 transitions. [2019-01-13 03:42:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:42:59,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:59,036 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] [2019-01-13 03:42:59,036 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2019-01-13 03:42:59,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:59,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:59,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:59,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:59,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:59,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:59,202 INFO L87 Difference]: Start difference. First operand 15684 states and 48127 transitions. Second operand 4 states. [2019-01-13 03:42:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:59,519 INFO L93 Difference]: Finished difference Result 19514 states and 59136 transitions. [2019-01-13 03:42:59,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:42:59,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 03:42:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:59,550 INFO L225 Difference]: With dead ends: 19514 [2019-01-13 03:42:59,550 INFO L226 Difference]: Without dead ends: 19514 [2019-01-13 03:42:59,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19514 states. [2019-01-13 03:42:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19514 to 15967. [2019-01-13 03:42:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15967 states. [2019-01-13 03:42:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15967 states to 15967 states and 48937 transitions. [2019-01-13 03:42:59,785 INFO L78 Accepts]: Start accepts. Automaton has 15967 states and 48937 transitions. Word has length 66 [2019-01-13 03:42:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:59,785 INFO L480 AbstractCegarLoop]: Abstraction has 15967 states and 48937 transitions. [2019-01-13 03:42:59,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15967 states and 48937 transitions. [2019-01-13 03:42:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:42:59,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:59,798 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] [2019-01-13 03:42:59,798 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:59,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2019-01-13 03:42:59,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:59,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:59,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:59,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:59,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:00,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:00,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:43:00,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:43:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:43:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:43:00,036 INFO L87 Difference]: Start difference. First operand 15967 states and 48937 transitions. Second operand 3 states. [2019-01-13 03:43:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:00,259 INFO L93 Difference]: Finished difference Result 16435 states and 50215 transitions. [2019-01-13 03:43:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:43:00,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 03:43:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:00,286 INFO L225 Difference]: With dead ends: 16435 [2019-01-13 03:43:00,286 INFO L226 Difference]: Without dead ends: 16435 [2019-01-13 03:43:00,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:43:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16435 states. [2019-01-13 03:43:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16435 to 16201. [2019-01-13 03:43:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16201 states. [2019-01-13 03:43:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16201 states to 16201 states and 49549 transitions. [2019-01-13 03:43:00,512 INFO L78 Accepts]: Start accepts. Automaton has 16201 states and 49549 transitions. Word has length 66 [2019-01-13 03:43:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:00,512 INFO L480 AbstractCegarLoop]: Abstraction has 16201 states and 49549 transitions. [2019-01-13 03:43:00,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:43:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16201 states and 49549 transitions. [2019-01-13 03:43:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:00,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:00,527 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] [2019-01-13 03:43:00,527 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2019-01-13 03:43:00,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:00,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:00,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:00,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:00,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:00,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:00,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:00,778 INFO L87 Difference]: Start difference. First operand 16201 states and 49549 transitions. Second operand 6 states. [2019-01-13 03:43:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:01,731 INFO L93 Difference]: Finished difference Result 19533 states and 58786 transitions. [2019-01-13 03:43:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:01,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:43:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:01,762 INFO L225 Difference]: With dead ends: 19533 [2019-01-13 03:43:01,762 INFO L226 Difference]: Without dead ends: 19533 [2019-01-13 03:43:01,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19533 states. [2019-01-13 03:43:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19533 to 18145. [2019-01-13 03:43:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18145 states. [2019-01-13 03:43:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18145 states to 18145 states and 54956 transitions. [2019-01-13 03:43:01,998 INFO L78 Accepts]: Start accepts. Automaton has 18145 states and 54956 transitions. Word has length 68 [2019-01-13 03:43:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:01,999 INFO L480 AbstractCegarLoop]: Abstraction has 18145 states and 54956 transitions. [2019-01-13 03:43:01,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 18145 states and 54956 transitions. [2019-01-13 03:43:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:02,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:02,012 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] [2019-01-13 03:43:02,012 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2019-01-13 03:43:02,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:02,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:02,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:02,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:02,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:02,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:02,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:02,305 INFO L87 Difference]: Start difference. First operand 18145 states and 54956 transitions. Second operand 6 states. [2019-01-13 03:43:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:02,755 INFO L93 Difference]: Finished difference Result 19926 states and 59453 transitions. [2019-01-13 03:43:02,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:43:02,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:43:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:02,786 INFO L225 Difference]: With dead ends: 19926 [2019-01-13 03:43:02,786 INFO L226 Difference]: Without dead ends: 19926 [2019-01-13 03:43:02,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:43:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19926 states. [2019-01-13 03:43:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19926 to 18237. [2019-01-13 03:43:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18237 states. [2019-01-13 03:43:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 54811 transitions. [2019-01-13 03:43:03,031 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 54811 transitions. Word has length 68 [2019-01-13 03:43:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:03,031 INFO L480 AbstractCegarLoop]: Abstraction has 18237 states and 54811 transitions. [2019-01-13 03:43:03,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 54811 transitions. [2019-01-13 03:43:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:03,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:03,043 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] [2019-01-13 03:43:03,044 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2019-01-13 03:43:03,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:03,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:03,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:03,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:03,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:03,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:03,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:03,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:03,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:03,488 INFO L87 Difference]: Start difference. First operand 18237 states and 54811 transitions. Second operand 5 states. [2019-01-13 03:43:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:04,115 INFO L93 Difference]: Finished difference Result 22525 states and 67154 transitions. [2019-01-13 03:43:04,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:04,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:43:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:04,149 INFO L225 Difference]: With dead ends: 22525 [2019-01-13 03:43:04,150 INFO L226 Difference]: Without dead ends: 22525 [2019-01-13 03:43:04,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22525 states. [2019-01-13 03:43:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22525 to 19323. [2019-01-13 03:43:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19323 states. [2019-01-13 03:43:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 57570 transitions. [2019-01-13 03:43:04,414 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 57570 transitions. Word has length 68 [2019-01-13 03:43:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:04,415 INFO L480 AbstractCegarLoop]: Abstraction has 19323 states and 57570 transitions. [2019-01-13 03:43:04,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 57570 transitions. [2019-01-13 03:43:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:04,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:04,427 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] [2019-01-13 03:43:04,427 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2019-01-13 03:43:04,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:04,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:04,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:04,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:04,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:04,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:04,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:04,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:04,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:04,853 INFO L87 Difference]: Start difference. First operand 19323 states and 57570 transitions. Second operand 5 states. [2019-01-13 03:43:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:06,140 INFO L93 Difference]: Finished difference Result 27944 states and 82376 transitions. [2019-01-13 03:43:06,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:06,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:43:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:06,194 INFO L225 Difference]: With dead ends: 27944 [2019-01-13 03:43:06,194 INFO L226 Difference]: Without dead ends: 27944 [2019-01-13 03:43:06,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27944 states. [2019-01-13 03:43:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27944 to 22126. [2019-01-13 03:43:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-01-13 03:43:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 65535 transitions. [2019-01-13 03:43:06,564 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 65535 transitions. Word has length 68 [2019-01-13 03:43:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:06,564 INFO L480 AbstractCegarLoop]: Abstraction has 22126 states and 65535 transitions. [2019-01-13 03:43:06,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 65535 transitions. [2019-01-13 03:43:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:06,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:06,583 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] [2019-01-13 03:43:06,584 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2019-01-13 03:43:06,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:06,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:06,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:06,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:06,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:06,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:06,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:06,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:06,757 INFO L87 Difference]: Start difference. First operand 22126 states and 65535 transitions. Second operand 6 states. [2019-01-13 03:43:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:07,779 INFO L93 Difference]: Finished difference Result 35126 states and 103809 transitions. [2019-01-13 03:43:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:07,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:43:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:07,841 INFO L225 Difference]: With dead ends: 35126 [2019-01-13 03:43:07,841 INFO L226 Difference]: Without dead ends: 35126 [2019-01-13 03:43:07,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35126 states. [2019-01-13 03:43:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35126 to 27938. [2019-01-13 03:43:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27938 states. [2019-01-13 03:43:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27938 states to 27938 states and 83546 transitions. [2019-01-13 03:43:08,456 INFO L78 Accepts]: Start accepts. Automaton has 27938 states and 83546 transitions. Word has length 68 [2019-01-13 03:43:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:08,456 INFO L480 AbstractCegarLoop]: Abstraction has 27938 states and 83546 transitions. [2019-01-13 03:43:08,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 27938 states and 83546 transitions. [2019-01-13 03:43:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:08,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:08,479 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] [2019-01-13 03:43:08,479 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2019-01-13 03:43:08,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:43:08,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:43:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:43:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:43:08,659 INFO L87 Difference]: Start difference. First operand 27938 states and 83546 transitions. Second operand 4 states. [2019-01-13 03:43:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:09,220 INFO L93 Difference]: Finished difference Result 30414 states and 90227 transitions. [2019-01-13 03:43:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:43:09,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-13 03:43:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:09,268 INFO L225 Difference]: With dead ends: 30414 [2019-01-13 03:43:09,268 INFO L226 Difference]: Without dead ends: 29906 [2019-01-13 03:43:09,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2019-01-13 03:43:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2019-01-13 03:43:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2019-01-13 03:43:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2019-01-13 03:43:09,670 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2019-01-13 03:43:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:09,670 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2019-01-13 03:43:09,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:43:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2019-01-13 03:43:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:09,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:09,688 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] [2019-01-13 03:43:09,689 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2019-01-13 03:43:09,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:10,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:43:10,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:43:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:43:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:43:10,084 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2019-01-13 03:43:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:11,949 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2019-01-13 03:43:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:43:11,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-01-13 03:43:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:12,006 INFO L225 Difference]: With dead ends: 34850 [2019-01-13 03:43:12,006 INFO L226 Difference]: Without dead ends: 34850 [2019-01-13 03:43:12,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:43:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2019-01-13 03:43:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2019-01-13 03:43:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2019-01-13 03:43:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2019-01-13 03:43:12,446 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2019-01-13 03:43:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:12,446 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2019-01-13 03:43:12,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:43:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2019-01-13 03:43:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:43:12,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:12,464 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] [2019-01-13 03:43:12,464 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2019-01-13 03:43:12,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:12,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:12,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:12,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:12,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:12,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:12,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:12,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:12,550 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2019-01-13 03:43:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:12,607 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2019-01-13 03:43:12,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:43:12,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:43:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:12,615 INFO L225 Difference]: With dead ends: 7664 [2019-01-13 03:43:12,615 INFO L226 Difference]: Without dead ends: 5913 [2019-01-13 03:43:12,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2019-01-13 03:43:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2019-01-13 03:43:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2019-01-13 03:43:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2019-01-13 03:43:12,667 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2019-01-13 03:43:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:12,668 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2019-01-13 03:43:12,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2019-01-13 03:43:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:12,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:12,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:12,674 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:12,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1506475877, now seen corresponding path program 1 times [2019-01-13 03:43:12,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:12,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:12,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:12,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:12,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:12,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:12,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:12,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:12,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:12,841 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 5 states. [2019-01-13 03:43:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:13,102 INFO L93 Difference]: Finished difference Result 6177 states and 14425 transitions. [2019-01-13 03:43:13,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:43:13,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-01-13 03:43:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:13,111 INFO L225 Difference]: With dead ends: 6177 [2019-01-13 03:43:13,111 INFO L226 Difference]: Without dead ends: 6143 [2019-01-13 03:43:13,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2019-01-13 03:43:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5262. [2019-01-13 03:43:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2019-01-13 03:43:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 12356 transitions. [2019-01-13 03:43:13,167 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 12356 transitions. Word has length 83 [2019-01-13 03:43:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:13,167 INFO L480 AbstractCegarLoop]: Abstraction has 5262 states and 12356 transitions. [2019-01-13 03:43:13,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 12356 transitions. [2019-01-13 03:43:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:13,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:13,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:13,178 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1808148118, now seen corresponding path program 1 times [2019-01-13 03:43:13,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:13,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:13,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:13,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:13,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:13,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:13,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:13,428 INFO L87 Difference]: Start difference. First operand 5262 states and 12356 transitions. Second operand 6 states. [2019-01-13 03:43:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:13,767 INFO L93 Difference]: Finished difference Result 7071 states and 16571 transitions. [2019-01-13 03:43:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:13,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:43:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:13,777 INFO L225 Difference]: With dead ends: 7071 [2019-01-13 03:43:13,777 INFO L226 Difference]: Without dead ends: 7039 [2019-01-13 03:43:13,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2019-01-13 03:43:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5567. [2019-01-13 03:43:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5567 states. [2019-01-13 03:43:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 13121 transitions. [2019-01-13 03:43:13,852 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 13121 transitions. Word has length 83 [2019-01-13 03:43:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:13,853 INFO L480 AbstractCegarLoop]: Abstraction has 5567 states and 13121 transitions. [2019-01-13 03:43:13,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 13121 transitions. [2019-01-13 03:43:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:13,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:13,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:13,860 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 11196759, now seen corresponding path program 1 times [2019-01-13 03:43:13,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:13,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:13,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:13,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:13,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:13,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:13,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:43:13,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:43:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:43:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:13,979 INFO L87 Difference]: Start difference. First operand 5567 states and 13121 transitions. Second operand 7 states. [2019-01-13 03:43:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:14,456 INFO L93 Difference]: Finished difference Result 8508 states and 20474 transitions. [2019-01-13 03:43:14,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:43:14,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-01-13 03:43:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:14,469 INFO L225 Difference]: With dead ends: 8508 [2019-01-13 03:43:14,469 INFO L226 Difference]: Without dead ends: 8508 [2019-01-13 03:43:14,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:43:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2019-01-13 03:43:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 6212. [2019-01-13 03:43:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2019-01-13 03:43:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 14765 transitions. [2019-01-13 03:43:14,555 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 14765 transitions. Word has length 83 [2019-01-13 03:43:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:14,556 INFO L480 AbstractCegarLoop]: Abstraction has 6212 states and 14765 transitions. [2019-01-13 03:43:14,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:43:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 14765 transitions. [2019-01-13 03:43:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:14,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:14,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:14,563 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash 898700440, now seen corresponding path program 1 times [2019-01-13 03:43:14,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:14,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:14,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:14,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:14,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:14,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:14,943 INFO L87 Difference]: Start difference. First operand 6212 states and 14765 transitions. Second operand 6 states. [2019-01-13 03:43:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:15,251 INFO L93 Difference]: Finished difference Result 7643 states and 17929 transitions. [2019-01-13 03:43:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:43:15,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:43:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:15,262 INFO L225 Difference]: With dead ends: 7643 [2019-01-13 03:43:15,262 INFO L226 Difference]: Without dead ends: 7643 [2019-01-13 03:43:15,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2019-01-13 03:43:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 6085. [2019-01-13 03:43:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6085 states. [2019-01-13 03:43:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 14405 transitions. [2019-01-13 03:43:15,337 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 14405 transitions. Word has length 83 [2019-01-13 03:43:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:15,337 INFO L480 AbstractCegarLoop]: Abstraction has 6085 states and 14405 transitions. [2019-01-13 03:43:15,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 14405 transitions. [2019-01-13 03:43:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:43:15,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:15,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:43:15,345 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2026859530, now seen corresponding path program 1 times [2019-01-13 03:43:15,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:15,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:15,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:15,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:15,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:15,757 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 03:43:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:15,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:15,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:15,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:15,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:15,946 INFO L87 Difference]: Start difference. First operand 6085 states and 14405 transitions. Second operand 6 states. [2019-01-13 03:43:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:16,093 INFO L93 Difference]: Finished difference Result 5733 states and 13253 transitions. [2019-01-13 03:43:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:16,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:43:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:16,103 INFO L225 Difference]: With dead ends: 5733 [2019-01-13 03:43:16,103 INFO L226 Difference]: Without dead ends: 5733 [2019-01-13 03:43:16,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:43:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2019-01-13 03:43:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 3489. [2019-01-13 03:43:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2019-01-13 03:43:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 8153 transitions. [2019-01-13 03:43:16,148 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 8153 transitions. Word has length 83 [2019-01-13 03:43:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:16,148 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 8153 transitions. [2019-01-13 03:43:16,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 8153 transitions. [2019-01-13 03:43:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:16,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:16,152 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] [2019-01-13 03:43:16,152 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2019-01-13 03:43:16,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:16,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:16,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:16,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:16,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:43:16,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:43:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:43:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:43:16,573 INFO L87 Difference]: Start difference. First operand 3489 states and 8153 transitions. Second operand 5 states. [2019-01-13 03:43:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:16,611 INFO L93 Difference]: Finished difference Result 3489 states and 8137 transitions. [2019-01-13 03:43:16,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:43:16,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-01-13 03:43:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:16,617 INFO L225 Difference]: With dead ends: 3489 [2019-01-13 03:43:16,617 INFO L226 Difference]: Without dead ends: 3489 [2019-01-13 03:43:16,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-01-13 03:43:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3063. [2019-01-13 03:43:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-01-13 03:43:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7125 transitions. [2019-01-13 03:43:16,649 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7125 transitions. Word has length 85 [2019-01-13 03:43:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:16,649 INFO L480 AbstractCegarLoop]: Abstraction has 3063 states and 7125 transitions. [2019-01-13 03:43:16,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:43:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7125 transitions. [2019-01-13 03:43:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:16,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:16,653 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] [2019-01-13 03:43:16,653 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2019-01-13 03:43:16,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:16,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:16,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:16,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:16,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:16,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:43:16,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:43:16,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:43:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:43:16,833 INFO L87 Difference]: Start difference. First operand 3063 states and 7125 transitions. Second operand 10 states. [2019-01-13 03:43:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:18,444 INFO L93 Difference]: Finished difference Result 5223 states and 12138 transitions. [2019-01-13 03:43:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:43:18,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-01-13 03:43:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:18,453 INFO L225 Difference]: With dead ends: 5223 [2019-01-13 03:43:18,453 INFO L226 Difference]: Without dead ends: 3650 [2019-01-13 03:43:18,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-01-13 03:43:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2019-01-13 03:43:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3140. [2019-01-13 03:43:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-01-13 03:43:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 7230 transitions. [2019-01-13 03:43:18,495 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 7230 transitions. Word has length 85 [2019-01-13 03:43:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:18,495 INFO L480 AbstractCegarLoop]: Abstraction has 3140 states and 7230 transitions. [2019-01-13 03:43:18,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:43:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 7230 transitions. [2019-01-13 03:43:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:18,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:18,500 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] [2019-01-13 03:43:18,500 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:18,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:18,500 INFO L82 PathProgramCache]: Analyzing trace with hash -749097736, now seen corresponding path program 1 times [2019-01-13 03:43:18,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:18,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:18,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:18,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:18,909 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 03:43:19,303 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 03:43:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:19,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:19,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:43:19,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:43:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:43:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:43:19,320 INFO L87 Difference]: Start difference. First operand 3140 states and 7230 transitions. Second operand 6 states. [2019-01-13 03:43:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:19,615 INFO L93 Difference]: Finished difference Result 3608 states and 8201 transitions. [2019-01-13 03:43:19,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:43:19,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-01-13 03:43:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:19,622 INFO L225 Difference]: With dead ends: 3608 [2019-01-13 03:43:19,622 INFO L226 Difference]: Without dead ends: 3554 [2019-01-13 03:43:19,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:43:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-01-13 03:43:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3141. [2019-01-13 03:43:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2019-01-13 03:43:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 7165 transitions. [2019-01-13 03:43:19,667 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 7165 transitions. Word has length 85 [2019-01-13 03:43:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:19,668 INFO L480 AbstractCegarLoop]: Abstraction has 3141 states and 7165 transitions. [2019-01-13 03:43:19,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:43:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 7165 transitions. [2019-01-13 03:43:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:19,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:19,672 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] [2019-01-13 03:43:19,673 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1468660217, now seen corresponding path program 2 times [2019-01-13 03:43:19,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:19,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:19,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:43:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:19,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:19,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:43:19,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:43:19,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:43:19,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:43:19,964 INFO L87 Difference]: Start difference. First operand 3141 states and 7165 transitions. Second operand 10 states. [2019-01-13 03:43:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:20,751 INFO L93 Difference]: Finished difference Result 5998 states and 13744 transitions. [2019-01-13 03:43:20,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:43:20,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-01-13 03:43:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:20,757 INFO L225 Difference]: With dead ends: 5998 [2019-01-13 03:43:20,757 INFO L226 Difference]: Without dead ends: 2311 [2019-01-13 03:43:20,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-01-13 03:43:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2019-01-13 03:43:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2019-01-13 03:43:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-01-13 03:43:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 5296 transitions. [2019-01-13 03:43:20,786 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 5296 transitions. Word has length 85 [2019-01-13 03:43:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:20,787 INFO L480 AbstractCegarLoop]: Abstraction has 2311 states and 5296 transitions. [2019-01-13 03:43:20,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:43:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 5296 transitions. [2019-01-13 03:43:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:20,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:20,790 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] [2019-01-13 03:43:20,791 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2019-01-13 03:43:20,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:20,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:20,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:43:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:43:21,061 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:43:21,239 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 03:43:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:43:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:43:21,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:43:21,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:43:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:43:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:43:21,387 INFO L87 Difference]: Start difference. First operand 2311 states and 5296 transitions. Second operand 11 states. [2019-01-13 03:43:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:22,437 INFO L93 Difference]: Finished difference Result 3845 states and 8830 transitions. [2019-01-13 03:43:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:43:22,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-01-13 03:43:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:22,441 INFO L225 Difference]: With dead ends: 3845 [2019-01-13 03:43:22,441 INFO L226 Difference]: Without dead ends: 2506 [2019-01-13 03:43:22,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 03:43:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-01-13 03:43:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2305. [2019-01-13 03:43:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-01-13 03:43:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5280 transitions. [2019-01-13 03:43:22,463 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5280 transitions. Word has length 85 [2019-01-13 03:43:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:22,464 INFO L480 AbstractCegarLoop]: Abstraction has 2305 states and 5280 transitions. [2019-01-13 03:43:22,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:43:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5280 transitions. [2019-01-13 03:43:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:22,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:22,467 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] [2019-01-13 03:43:22,467 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2019-01-13 03:43:22,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:22,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:43:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:43:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:43:22,569 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:43:22,763 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:43:22,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:43:22 BasicIcfg [2019-01-13 03:43:22,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:43:22,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:43:22,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:43:22,767 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:43:22,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:26" (3/4) ... [2019-01-13 03:43:22,773 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:43:22,943 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:43:22,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:43:22,944 INFO L168 Benchmark]: Toolchain (without parser) took 58677.80 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 947.3 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 344.6 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:22,946 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:22,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 922.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:22,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.85 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:22,947 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:22,947 INFO L168 Benchmark]: RCFGBuilder took 1031.44 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:22,950 INFO L168 Benchmark]: TraceAbstraction took 56439.76 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 322.2 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:22,951 INFO L168 Benchmark]: Witness Printer took 176.11 ms. Allocated memory is still 4.6 GB. Free memory is still 4.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:22,955 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 922.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.85 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.83 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. * RCFGBuilder took 1031.44 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56439.76 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 322.2 MB. Max. memory is 11.5 GB. * Witness Printer took 176.11 ms. Allocated memory is still 4.6 GB. Free memory is still 4.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1653; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1654; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 56.2s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 28.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8706 SDtfs, 10478 SDslu, 20543 SDs, 0 SdLazy, 8915 SolverSat, 456 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 79 SyntacticMatches, 17 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, 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: 15.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 165239 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2195 NumberOfCodeBlocks, 2195 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 381936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...