./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi008_pso.oepc_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/rfi008_pso.oepc_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 69abe9278bebb0b6d0705933968afb25b04ff736 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:47:10,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:47:10,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:47:10,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:47:10,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:47:10,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:47:10,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:47:10,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:47:10,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:47:10,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:47:10,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:47:10,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:47:10,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:47:10,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:47:10,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:47:10,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:47:10,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:47:10,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:47:10,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:47:10,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:47:10,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:47:10,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:47:10,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:47:10,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:47:10,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:47:10,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:47:10,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:47:10,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:47:10,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:47:10,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:47:10,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:47:10,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:47:10,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:47:10,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:47:10,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:47:10,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:47:10,390 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:47:10,404 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:47:10,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:47:10,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:47:10,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:47:10,406 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:47:10,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:47:10,407 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:47:10,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:47:10,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:47:10,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:47:10,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:47:10,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:47:10,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:47:10,408 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:47:10,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:47:10,408 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:47:10,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:47:10,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:47:10,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:47:10,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:47:10,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:47:10,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:47:10,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:47:10,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:47:10,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:47:10,410 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:47:10,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:47:10,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:47:10,411 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 -> 69abe9278bebb0b6d0705933968afb25b04ff736 [2019-01-13 03:47:10,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:47:10,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:47:10,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:47:10,463 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:47:10,463 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:47:10,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi008_pso.oepc_false-unreach-call.i [2019-01-13 03:47:10,519 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85dd71a7/7837b1ba4af44666991b6c43f770eddf/FLAG7cf8befbe [2019-01-13 03:47:11,098 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:47:11,099 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi008_pso.oepc_false-unreach-call.i [2019-01-13 03:47:11,124 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85dd71a7/7837b1ba4af44666991b6c43f770eddf/FLAG7cf8befbe [2019-01-13 03:47:11,319 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85dd71a7/7837b1ba4af44666991b6c43f770eddf [2019-01-13 03:47:11,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:47:11,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:47:11,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:47:11,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:47:11,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:47:11,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:47:11" (1/1) ... [2019-01-13 03:47:11,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b035c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:11, skipping insertion in model container [2019-01-13 03:47:11,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:47:11" (1/1) ... [2019-01-13 03:47:11,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:47:11,399 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:47:11,973 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:47:12,003 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:47:12,220 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:47:12,303 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:47:12,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12 WrapperNode [2019-01-13 03:47:12,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:47:12,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:47:12,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:47:12,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:47:12,316 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:47:12" (1/1) ... [2019-01-13 03:47:12,351 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:47:12" (1/1) ... [2019-01-13 03:47:12,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:47:12,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:47:12,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:47:12,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:47:12,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (1/1) ... [2019-01-13 03:47:12,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (1/1) ... [2019-01-13 03:47:12,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (1/1) ... [2019-01-13 03:47:12,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (1/1) ... [2019-01-13 03:47:12,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (1/1) ... [2019-01-13 03:47:12,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (1/1) ... [2019-01-13 03:47:12,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (1/1) ... [2019-01-13 03:47:12,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:47:12,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:47:12,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:47:12,441 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:47:12,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (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:47:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:47:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:47:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:47:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:47:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:47:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:47:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:47:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:47:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:47:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:47:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:47:12,524 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:47:13,862 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:47:13,863 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:47:13,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:47:13 BoogieIcfgContainer [2019-01-13 03:47:13,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:47:13,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:47:13,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:47:13,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:47:13,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:47:11" (1/3) ... [2019-01-13 03:47:13,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72af96c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:47:13, skipping insertion in model container [2019-01-13 03:47:13,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:47:12" (2/3) ... [2019-01-13 03:47:13,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72af96c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:47:13, skipping insertion in model container [2019-01-13 03:47:13,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:47:13" (3/3) ... [2019-01-13 03:47:13,875 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_pso.oepc_false-unreach-call.i [2019-01-13 03:47:13,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,931 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,931 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,931 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,932 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,934 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,977 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,977 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:13,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:47:14,064 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:47:14,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:47:14,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:47:14,090 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:47:14,114 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:47:14,115 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:47:14,115 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:47:14,115 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:47:14,115 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:47:14,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:47:14,115 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:47:14,116 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:47:14,116 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:47:14,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2019-01-13 03:47:26,323 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2019-01-13 03:47:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2019-01-13 03:47:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 03:47:26,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:47:26,334 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] [2019-01-13 03:47:26,336 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:47:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:47:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2019-01-13 03:47:26,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:47:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:47:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:47:26,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:47:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:47:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:47:26,758 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:47:26,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:47:26,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:47:26,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:47:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:47:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:47:26,779 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2019-01-13 03:47:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:47:29,031 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2019-01-13 03:47:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:47:29,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-13 03:47:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:47:29,933 INFO L225 Difference]: With dead ends: 192000 [2019-01-13 03:47:29,933 INFO L226 Difference]: Without dead ends: 135832 [2019-01-13 03:47:29,936 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:47:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2019-01-13 03:47:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2019-01-13 03:47:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2019-01-13 03:47:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2019-01-13 03:47:41,042 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2019-01-13 03:47:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:47:41,048 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2019-01-13 03:47:41,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:47:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2019-01-13 03:47:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 03:47:41,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:47:41,068 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:47:41,068 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:47:41,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:47:41,069 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2019-01-13 03:47:41,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:47:41,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:47:41,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:47:41,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:47:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:47:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:47:41,283 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:47:41,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:47:41,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:47:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:47:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:47:41,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:47:41,287 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2019-01-13 03:47:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:47:44,367 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2019-01-13 03:47:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:47:44,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 03:47:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:47:45,245 INFO L225 Difference]: With dead ends: 195844 [2019-01-13 03:47:45,245 INFO L226 Difference]: Without dead ends: 195292 [2019-01-13 03:47:45,246 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:47:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2019-01-13 03:47:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2019-01-13 03:47:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2019-01-13 03:47:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2019-01-13 03:47:51,346 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2019-01-13 03:47:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:47:51,347 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2019-01-13 03:47:51,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:47:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2019-01-13 03:47:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 03:47:51,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:47:51,356 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:47:51,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:47:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:47:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2019-01-13 03:47:51,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:47:51,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:47:51,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:47:51,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:47:51,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:47:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:47:51,462 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:47:51,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:47:51,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:47:51,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:47:51,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:47:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:47:51,464 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2019-01-13 03:47:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:47:54,723 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2019-01-13 03:47:54,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:47:54,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-13 03:47:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:47:55,465 INFO L225 Difference]: With dead ends: 253868 [2019-01-13 03:47:55,465 INFO L226 Difference]: Without dead ends: 253356 [2019-01-13 03:47:55,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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:47:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2019-01-13 03:48:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2019-01-13 03:48:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2019-01-13 03:48:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2019-01-13 03:48:07,967 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2019-01-13 03:48:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:48:07,968 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2019-01-13 03:48:07,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:48:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2019-01-13 03:48:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 03:48:07,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:48:07,979 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:48:07,979 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:48:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:48:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2019-01-13 03:48:07,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:48:07,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:48:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:48:07,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:48:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:48:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:48:08,093 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:48:08,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:48:08,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:48:08,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:48:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:48:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:48:08,095 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2019-01-13 03:48:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:48:09,448 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2019-01-13 03:48:09,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:48:09,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-13 03:48:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:48:10,171 INFO L225 Difference]: With dead ends: 234162 [2019-01-13 03:48:10,171 INFO L226 Difference]: Without dead ends: 234162 [2019-01-13 03:48:10,172 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:48:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2019-01-13 03:48:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2019-01-13 03:48:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2019-01-13 03:48:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2019-01-13 03:48:20,365 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2019-01-13 03:48:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:48:20,366 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2019-01-13 03:48:20,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:48:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2019-01-13 03:48:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:48:20,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:48:20,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, 1, 1, 1, 1] [2019-01-13 03:48:20,401 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:48:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:48:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2019-01-13 03:48:20,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:48:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:48:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:48:20,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:48:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:48:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:48:20,557 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:48:20,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:48:20,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:48:20,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:48:20,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:48:20,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:48:20,559 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2019-01-13 03:48:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:48:23,983 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2019-01-13 03:48:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:48:23,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 03:48:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:48:25,276 INFO L225 Difference]: With dead ends: 402833 [2019-01-13 03:48:25,276 INFO L226 Difference]: Without dead ends: 402257 [2019-01-13 03:48:25,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:48:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2019-01-13 03:48:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2019-01-13 03:48:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2019-01-13 03:48:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2019-01-13 03:48:43,928 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2019-01-13 03:48:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:48:43,929 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2019-01-13 03:48:43,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:48:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2019-01-13 03:48:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:48:43,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:48:43,958 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:48:43,958 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:48:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:48:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1930693029, now seen corresponding path program 1 times [2019-01-13 03:48:43,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:48:43,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:48:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:48:43,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:48:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:48:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:48:44,096 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:48:44,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:48:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:48:44,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:48:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:48:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:48:44,098 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2019-01-13 03:48:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:48:49,985 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2019-01-13 03:48:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:48:49,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-13 03:48:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:48:50,996 INFO L225 Difference]: With dead ends: 325852 [2019-01-13 03:48:50,996 INFO L226 Difference]: Without dead ends: 325852 [2019-01-13 03:48:50,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:48:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2019-01-13 03:49:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2019-01-13 03:49:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2019-01-13 03:49:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2019-01-13 03:49:09,859 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2019-01-13 03:49:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:09,859 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2019-01-13 03:49:09,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2019-01-13 03:49:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:49:09,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:09,887 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:49:09,887 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1476770586, now seen corresponding path program 1 times [2019-01-13 03:49:09,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:09,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:09,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:10,048 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:49:10,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:10,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:49:10,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:49:10,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:49:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:49:10,051 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 4 states. [2019-01-13 03:49:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:10,233 INFO L93 Difference]: Finished difference Result 40004 states and 128000 transitions. [2019-01-13 03:49:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:49:10,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-13 03:49:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:10,291 INFO L225 Difference]: With dead ends: 40004 [2019-01-13 03:49:10,291 INFO L226 Difference]: Without dead ends: 32121 [2019-01-13 03:49:10,292 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:49:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32121 states. [2019-01-13 03:49:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32121 to 31856. [2019-01-13 03:49:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31856 states. [2019-01-13 03:49:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31856 states to 31856 states and 99339 transitions. [2019-01-13 03:49:10,758 INFO L78 Accepts]: Start accepts. Automaton has 31856 states and 99339 transitions. Word has length 54 [2019-01-13 03:49:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:10,758 INFO L480 AbstractCegarLoop]: Abstraction has 31856 states and 99339 transitions. [2019-01-13 03:49:10,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:49:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 31856 states and 99339 transitions. [2019-01-13 03:49:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 03:49:10,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:10,764 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] [2019-01-13 03:49:10,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:10,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2019-01-13 03:49:10,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:10,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:10,935 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:49:10,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:49:10,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:49:10,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:49:10,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:49:10,938 INFO L87 Difference]: Start difference. First operand 31856 states and 99339 transitions. Second operand 4 states. [2019-01-13 03:49:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:11,176 INFO L93 Difference]: Finished difference Result 34930 states and 108729 transitions. [2019-01-13 03:49:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:49:11,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-01-13 03:49:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:11,240 INFO L225 Difference]: With dead ends: 34930 [2019-01-13 03:49:11,240 INFO L226 Difference]: Without dead ends: 34930 [2019-01-13 03:49:11,240 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:49:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34930 states. [2019-01-13 03:49:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34930 to 32961. [2019-01-13 03:49:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32961 states. [2019-01-13 03:49:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32961 states to 32961 states and 102685 transitions. [2019-01-13 03:49:13,236 INFO L78 Accepts]: Start accepts. Automaton has 32961 states and 102685 transitions. Word has length 62 [2019-01-13 03:49:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:13,236 INFO L480 AbstractCegarLoop]: Abstraction has 32961 states and 102685 transitions. [2019-01-13 03:49:13,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:49:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32961 states and 102685 transitions. [2019-01-13 03:49:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 03:49:13,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:13,242 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] [2019-01-13 03:49:13,243 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:13,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2019-01-13 03:49:13,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:13,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:13,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:13,508 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:49:13,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:13,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:49:13,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:49:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:49:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:49:13,509 INFO L87 Difference]: Start difference. First operand 32961 states and 102685 transitions. Second operand 6 states. [2019-01-13 03:49:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:14,497 INFO L93 Difference]: Finished difference Result 67635 states and 208886 transitions. [2019-01-13 03:49:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:49:14,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-01-13 03:49:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:14,616 INFO L225 Difference]: With dead ends: 67635 [2019-01-13 03:49:14,616 INFO L226 Difference]: Without dead ends: 67564 [2019-01-13 03:49:14,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:49:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67564 states. [2019-01-13 03:49:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67564 to 41015. [2019-01-13 03:49:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41015 states. [2019-01-13 03:49:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41015 states to 41015 states and 125282 transitions. [2019-01-13 03:49:15,415 INFO L78 Accepts]: Start accepts. Automaton has 41015 states and 125282 transitions. Word has length 62 [2019-01-13 03:49:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:15,415 INFO L480 AbstractCegarLoop]: Abstraction has 41015 states and 125282 transitions. [2019-01-13 03:49:15,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:49:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41015 states and 125282 transitions. [2019-01-13 03:49:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:49:15,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:15,426 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:49:15,427 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2019-01-13 03:49:15,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:15,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:15,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:15,519 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:49:15,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:15,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:49:15,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:49:15,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:49:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:49:15,520 INFO L87 Difference]: Start difference. First operand 41015 states and 125282 transitions. Second operand 3 states. [2019-01-13 03:49:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:15,853 INFO L93 Difference]: Finished difference Result 51798 states and 156710 transitions. [2019-01-13 03:49:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:49:15,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-13 03:49:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:15,949 INFO L225 Difference]: With dead ends: 51798 [2019-01-13 03:49:15,949 INFO L226 Difference]: Without dead ends: 51798 [2019-01-13 03:49:15,949 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:49:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51798 states. [2019-01-13 03:49:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51798 to 42292. [2019-01-13 03:49:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42292 states. [2019-01-13 03:49:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42292 states to 42292 states and 126845 transitions. [2019-01-13 03:49:16,689 INFO L78 Accepts]: Start accepts. Automaton has 42292 states and 126845 transitions. Word has length 68 [2019-01-13 03:49:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:16,689 INFO L480 AbstractCegarLoop]: Abstraction has 42292 states and 126845 transitions. [2019-01-13 03:49:16,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:49:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42292 states and 126845 transitions. [2019-01-13 03:49:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-13 03:49:16,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:16,707 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] [2019-01-13 03:49:16,708 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:16,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2019-01-13 03:49:16,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:16,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:16,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:16,875 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:49:16,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:16,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:49:16,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:49:16,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:49:16,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:49:16,876 INFO L87 Difference]: Start difference. First operand 42292 states and 126845 transitions. Second operand 5 states. [2019-01-13 03:49:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:18,754 INFO L93 Difference]: Finished difference Result 48657 states and 145545 transitions. [2019-01-13 03:49:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:49:18,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-01-13 03:49:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:18,833 INFO L225 Difference]: With dead ends: 48657 [2019-01-13 03:49:18,834 INFO L226 Difference]: Without dead ends: 48657 [2019-01-13 03:49:18,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:49:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48657 states. [2019-01-13 03:49:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48657 to 46478. [2019-01-13 03:49:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46478 states. [2019-01-13 03:49:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46478 states to 46478 states and 139163 transitions. [2019-01-13 03:49:19,473 INFO L78 Accepts]: Start accepts. Automaton has 46478 states and 139163 transitions. Word has length 74 [2019-01-13 03:49:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:19,474 INFO L480 AbstractCegarLoop]: Abstraction has 46478 states and 139163 transitions. [2019-01-13 03:49:19,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:49:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 46478 states and 139163 transitions. [2019-01-13 03:49:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-13 03:49:19,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:19,490 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] [2019-01-13 03:49:19,490 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2019-01-13 03:49:19,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:19,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:19,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:19,992 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:49:19,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:19,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:49:19,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:49:19,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:49:19,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:19,996 INFO L87 Difference]: Start difference. First operand 46478 states and 139163 transitions. Second operand 7 states. [2019-01-13 03:49:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:21,383 INFO L93 Difference]: Finished difference Result 55120 states and 165119 transitions. [2019-01-13 03:49:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:49:21,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-01-13 03:49:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:21,486 INFO L225 Difference]: With dead ends: 55120 [2019-01-13 03:49:21,486 INFO L226 Difference]: Without dead ends: 55033 [2019-01-13 03:49:21,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-13 03:49:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55033 states. [2019-01-13 03:49:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55033 to 43556. [2019-01-13 03:49:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43556 states. [2019-01-13 03:49:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43556 states to 43556 states and 131652 transitions. [2019-01-13 03:49:22,204 INFO L78 Accepts]: Start accepts. Automaton has 43556 states and 131652 transitions. Word has length 74 [2019-01-13 03:49:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:22,204 INFO L480 AbstractCegarLoop]: Abstraction has 43556 states and 131652 transitions. [2019-01-13 03:49:22,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 43556 states and 131652 transitions. [2019-01-13 03:49:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 03:49:22,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:22,221 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] [2019-01-13 03:49:22,221 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2019-01-13 03:49:22,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:22,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:22,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:22,485 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:49:22,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:22,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:49:22,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:49:22,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:49:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:49:22,489 INFO L87 Difference]: Start difference. First operand 43556 states and 131652 transitions. Second operand 4 states. [2019-01-13 03:49:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:24,252 INFO L93 Difference]: Finished difference Result 57609 states and 170299 transitions. [2019-01-13 03:49:24,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:49:24,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-13 03:49:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:24,353 INFO L225 Difference]: With dead ends: 57609 [2019-01-13 03:49:24,353 INFO L226 Difference]: Without dead ends: 57609 [2019-01-13 03:49:24,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:49:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57609 states. [2019-01-13 03:49:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57609 to 52125. [2019-01-13 03:49:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52125 states. [2019-01-13 03:49:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52125 states to 52125 states and 155286 transitions. [2019-01-13 03:49:25,468 INFO L78 Accepts]: Start accepts. Automaton has 52125 states and 155286 transitions. Word has length 76 [2019-01-13 03:49:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:25,468 INFO L480 AbstractCegarLoop]: Abstraction has 52125 states and 155286 transitions. [2019-01-13 03:49:25,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:49:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 52125 states and 155286 transitions. [2019-01-13 03:49:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 03:49:25,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:25,486 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] [2019-01-13 03:49:25,486 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1204792523, now seen corresponding path program 1 times [2019-01-13 03:49:25,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:25,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:25,875 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:49:25,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:25,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:49:25,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:49:25,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:49:25,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:25,877 INFO L87 Difference]: Start difference. First operand 52125 states and 155286 transitions. Second operand 7 states. [2019-01-13 03:49:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:28,743 INFO L93 Difference]: Finished difference Result 107287 states and 317337 transitions. [2019-01-13 03:49:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:49:28,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-01-13 03:49:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:28,934 INFO L225 Difference]: With dead ends: 107287 [2019-01-13 03:49:28,934 INFO L226 Difference]: Without dead ends: 107223 [2019-01-13 03:49:28,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-01-13 03:49:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107223 states. [2019-01-13 03:49:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107223 to 57323. [2019-01-13 03:49:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57323 states. [2019-01-13 03:49:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57323 states to 57323 states and 168943 transitions. [2019-01-13 03:49:30,088 INFO L78 Accepts]: Start accepts. Automaton has 57323 states and 168943 transitions. Word has length 76 [2019-01-13 03:49:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:30,089 INFO L480 AbstractCegarLoop]: Abstraction has 57323 states and 168943 transitions. [2019-01-13 03:49:30,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 57323 states and 168943 transitions. [2019-01-13 03:49:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:49:30,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:30,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:30,132 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:30,133 INFO L82 PathProgramCache]: Analyzing trace with hash -885471404, now seen corresponding path program 1 times [2019-01-13 03:49:30,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:30,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:30,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:30,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:30,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:30,283 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:49:30,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:30,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:49:30,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:49:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:49:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:49:30,284 INFO L87 Difference]: Start difference. First operand 57323 states and 168943 transitions. Second operand 4 states. [2019-01-13 03:49:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:30,894 INFO L93 Difference]: Finished difference Result 63745 states and 186999 transitions. [2019-01-13 03:49:30,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:49:30,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-01-13 03:49:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:31,007 INFO L225 Difference]: With dead ends: 63745 [2019-01-13 03:49:31,007 INFO L226 Difference]: Without dead ends: 63745 [2019-01-13 03:49:31,008 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:49:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63745 states. [2019-01-13 03:49:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63745 to 62467. [2019-01-13 03:49:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62467 states. [2019-01-13 03:49:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62467 states to 62467 states and 183268 transitions. [2019-01-13 03:49:32,213 INFO L78 Accepts]: Start accepts. Automaton has 62467 states and 183268 transitions. Word has length 82 [2019-01-13 03:49:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:32,214 INFO L480 AbstractCegarLoop]: Abstraction has 62467 states and 183268 transitions. [2019-01-13 03:49:32,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:49:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 62467 states and 183268 transitions. [2019-01-13 03:49:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:49:32,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:32,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, 1, 1, 1, 1, 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:49:32,263 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1332286549, now seen corresponding path program 1 times [2019-01-13 03:49:32,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:32,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:32,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:32,365 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:49:32,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:32,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:49:32,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:49:32,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:49:32,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:49:32,366 INFO L87 Difference]: Start difference. First operand 62467 states and 183268 transitions. Second operand 3 states. [2019-01-13 03:49:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:32,889 INFO L93 Difference]: Finished difference Result 74968 states and 215886 transitions. [2019-01-13 03:49:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:49:32,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-01-13 03:49:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:33,007 INFO L225 Difference]: With dead ends: 74968 [2019-01-13 03:49:33,007 INFO L226 Difference]: Without dead ends: 74968 [2019-01-13 03:49:33,007 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:49:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74968 states. [2019-01-13 03:49:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74968 to 70220. [2019-01-13 03:49:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70220 states. [2019-01-13 03:49:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70220 states to 70220 states and 203363 transitions. [2019-01-13 03:49:34,000 INFO L78 Accepts]: Start accepts. Automaton has 70220 states and 203363 transitions. Word has length 82 [2019-01-13 03:49:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:34,001 INFO L480 AbstractCegarLoop]: Abstraction has 70220 states and 203363 transitions. [2019-01-13 03:49:34,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:49:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 70220 states and 203363 transitions. [2019-01-13 03:49:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:49:34,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:34,041 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:49:34,041 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1584283171, now seen corresponding path program 1 times [2019-01-13 03:49:34,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:34,205 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:49:34,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:34,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:49:34,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:49:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:49:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:49:34,207 INFO L87 Difference]: Start difference. First operand 70220 states and 203363 transitions. Second operand 4 states. [2019-01-13 03:49:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:34,539 INFO L93 Difference]: Finished difference Result 76675 states and 219295 transitions. [2019-01-13 03:49:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:49:34,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-01-13 03:49:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:34,682 INFO L225 Difference]: With dead ends: 76675 [2019-01-13 03:49:34,682 INFO L226 Difference]: Without dead ends: 76675 [2019-01-13 03:49:34,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:49:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76675 states. [2019-01-13 03:49:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76675 to 71702. [2019-01-13 03:49:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2019-01-13 03:49:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2019-01-13 03:49:36,139 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2019-01-13 03:49:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:36,139 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2019-01-13 03:49:36,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:49:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2019-01-13 03:49:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:49:36,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:36,174 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:49:36,175 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash 800132444, now seen corresponding path program 1 times [2019-01-13 03:49:36,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:36,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:36,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:36,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:36,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:36,471 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:49:36,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:36,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:49:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:49:36,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:49:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:49:36,473 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2019-01-13 03:49:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:39,483 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2019-01-13 03:49:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-13 03:49:39,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-01-13 03:49:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:39,809 INFO L225 Difference]: With dead ends: 164487 [2019-01-13 03:49:39,810 INFO L226 Difference]: Without dead ends: 164487 [2019-01-13 03:49:39,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2019-01-13 03:49:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2019-01-13 03:49:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2019-01-13 03:49:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2019-01-13 03:49:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2019-01-13 03:49:42,348 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2019-01-13 03:49:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:42,349 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2019-01-13 03:49:42,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:49:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2019-01-13 03:49:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:49:42,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:42,396 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:49:42,396 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:42,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1687636125, now seen corresponding path program 1 times [2019-01-13 03:49:42,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:42,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:42,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:42,635 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:49:42,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:42,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:49:42,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:49:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:49:42,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:49:42,637 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 5 states. [2019-01-13 03:49:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:42,886 INFO L93 Difference]: Finished difference Result 35805 states and 86792 transitions. [2019-01-13 03:49:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:49:42,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-01-13 03:49:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:42,925 INFO L225 Difference]: With dead ends: 35805 [2019-01-13 03:49:42,925 INFO L226 Difference]: Without dead ends: 31165 [2019-01-13 03:49:42,926 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:49:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31165 states. [2019-01-13 03:49:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31165 to 26658. [2019-01-13 03:49:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2019-01-13 03:49:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 63590 transitions. [2019-01-13 03:49:43,281 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 63590 transitions. Word has length 83 [2019-01-13 03:49:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:43,281 INFO L480 AbstractCegarLoop]: Abstraction has 26658 states and 63590 transitions. [2019-01-13 03:49:43,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:49:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 63590 transitions. [2019-01-13 03:49:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 03:49:43,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:43,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:43,318 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:43,318 INFO L82 PathProgramCache]: Analyzing trace with hash 905467640, now seen corresponding path program 1 times [2019-01-13 03:49:43,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:43,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:43,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:43,476 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:49:43,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:43,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:49:43,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:49:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:49:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:49:43,477 INFO L87 Difference]: Start difference. First operand 26658 states and 63590 transitions. Second operand 5 states. [2019-01-13 03:49:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:43,676 INFO L93 Difference]: Finished difference Result 30725 states and 72487 transitions. [2019-01-13 03:49:43,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:49:43,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-13 03:49:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:43,713 INFO L225 Difference]: With dead ends: 30725 [2019-01-13 03:49:43,713 INFO L226 Difference]: Without dead ends: 30725 [2019-01-13 03:49:43,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2019-01-13 03:49:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 24444. [2019-01-13 03:49:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24444 states. [2019-01-13 03:49:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24444 states to 24444 states and 57727 transitions. [2019-01-13 03:49:44,010 INFO L78 Accepts]: Start accepts. Automaton has 24444 states and 57727 transitions. Word has length 111 [2019-01-13 03:49:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:44,010 INFO L480 AbstractCegarLoop]: Abstraction has 24444 states and 57727 transitions. [2019-01-13 03:49:44,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:49:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 24444 states and 57727 transitions. [2019-01-13 03:49:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 03:49:44,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:44,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:44,035 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:44,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1343477143, now seen corresponding path program 1 times [2019-01-13 03:49:44,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:44,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:44,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:44,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:44,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:44,339 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:49:44,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:44,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:49:44,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:49:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:49:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:49:44,340 INFO L87 Difference]: Start difference. First operand 24444 states and 57727 transitions. Second operand 8 states. [2019-01-13 03:49:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:45,673 INFO L93 Difference]: Finished difference Result 36935 states and 85768 transitions. [2019-01-13 03:49:45,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:49:45,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-01-13 03:49:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:45,719 INFO L225 Difference]: With dead ends: 36935 [2019-01-13 03:49:45,719 INFO L226 Difference]: Without dead ends: 36697 [2019-01-13 03:49:45,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:49:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36697 states. [2019-01-13 03:49:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36697 to 29289. [2019-01-13 03:49:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29289 states. [2019-01-13 03:49:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29289 states to 29289 states and 68874 transitions. [2019-01-13 03:49:46,232 INFO L78 Accepts]: Start accepts. Automaton has 29289 states and 68874 transitions. Word has length 111 [2019-01-13 03:49:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:46,232 INFO L480 AbstractCegarLoop]: Abstraction has 29289 states and 68874 transitions. [2019-01-13 03:49:46,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:49:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 29289 states and 68874 transitions. [2019-01-13 03:49:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 03:49:46,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:46,262 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash -921363243, now seen corresponding path program 1 times [2019-01-13 03:49:46,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:46,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:46,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:46,452 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:49:46,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:46,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:49:46,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:49:46,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:49:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:46,453 INFO L87 Difference]: Start difference. First operand 29289 states and 68874 transitions. Second operand 7 states. [2019-01-13 03:49:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:47,479 INFO L93 Difference]: Finished difference Result 38468 states and 90627 transitions. [2019-01-13 03:49:47,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:49:47,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2019-01-13 03:49:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:47,525 INFO L225 Difference]: With dead ends: 38468 [2019-01-13 03:49:47,525 INFO L226 Difference]: Without dead ends: 38468 [2019-01-13 03:49:47,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:49:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38468 states. [2019-01-13 03:49:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38468 to 29582. [2019-01-13 03:49:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29582 states. [2019-01-13 03:49:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29582 states to 29582 states and 69641 transitions. [2019-01-13 03:49:47,925 INFO L78 Accepts]: Start accepts. Automaton has 29582 states and 69641 transitions. Word has length 111 [2019-01-13 03:49:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:47,925 INFO L480 AbstractCegarLoop]: Abstraction has 29582 states and 69641 transitions. [2019-01-13 03:49:47,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 29582 states and 69641 transitions. [2019-01-13 03:49:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 03:49:47,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:47,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:47,958 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash -33859562, now seen corresponding path program 1 times [2019-01-13 03:49:47,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:47,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:48,409 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:49:48,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:48,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:49:48,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:49:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:49:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:49:48,410 INFO L87 Difference]: Start difference. First operand 29582 states and 69641 transitions. Second operand 8 states. [2019-01-13 03:49:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:49,514 INFO L93 Difference]: Finished difference Result 37569 states and 87674 transitions. [2019-01-13 03:49:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:49:49,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-01-13 03:49:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:49,560 INFO L225 Difference]: With dead ends: 37569 [2019-01-13 03:49:49,560 INFO L226 Difference]: Without dead ends: 37569 [2019-01-13 03:49:49,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:49:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37569 states. [2019-01-13 03:49:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37569 to 30966. [2019-01-13 03:49:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30966 states. [2019-01-13 03:49:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30966 states to 30966 states and 72227 transitions. [2019-01-13 03:49:49,943 INFO L78 Accepts]: Start accepts. Automaton has 30966 states and 72227 transitions. Word has length 111 [2019-01-13 03:49:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:49,943 INFO L480 AbstractCegarLoop]: Abstraction has 30966 states and 72227 transitions. [2019-01-13 03:49:49,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:49:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30966 states and 72227 transitions. [2019-01-13 03:49:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 03:49:49,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:49,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:49,975 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2095629092, now seen corresponding path program 2 times [2019-01-13 03:49:49,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:49,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:50,299 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:49:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:49:50,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:49:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:49:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:49:50,302 INFO L87 Difference]: Start difference. First operand 30966 states and 72227 transitions. Second operand 5 states. [2019-01-13 03:49:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:51,106 INFO L93 Difference]: Finished difference Result 31773 states and 74012 transitions. [2019-01-13 03:49:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:49:51,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-13 03:49:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:51,145 INFO L225 Difference]: With dead ends: 31773 [2019-01-13 03:49:51,145 INFO L226 Difference]: Without dead ends: 31773 [2019-01-13 03:49:51,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31773 states. [2019-01-13 03:49:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31773 to 31400. [2019-01-13 03:49:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31400 states. [2019-01-13 03:49:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31400 states to 31400 states and 73200 transitions. [2019-01-13 03:49:51,542 INFO L78 Accepts]: Start accepts. Automaton has 31400 states and 73200 transitions. Word has length 111 [2019-01-13 03:49:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:51,543 INFO L480 AbstractCegarLoop]: Abstraction has 31400 states and 73200 transitions. [2019-01-13 03:49:51,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:49:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 31400 states and 73200 transitions. [2019-01-13 03:49:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 03:49:51,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:51,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:51,582 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash 932776990, now seen corresponding path program 1 times [2019-01-13 03:49:51,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:51,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:51,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:49:51,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:51,867 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:49:51,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:51,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:49:51,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:49:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:49:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:51,868 INFO L87 Difference]: Start difference. First operand 31400 states and 73200 transitions. Second operand 7 states. [2019-01-13 03:49:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:52,399 INFO L93 Difference]: Finished difference Result 38789 states and 89654 transitions. [2019-01-13 03:49:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:49:52,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-01-13 03:49:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:52,445 INFO L225 Difference]: With dead ends: 38789 [2019-01-13 03:49:52,445 INFO L226 Difference]: Without dead ends: 38789 [2019-01-13 03:49:52,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:49:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38789 states. [2019-01-13 03:49:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38789 to 33306. [2019-01-13 03:49:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33306 states. [2019-01-13 03:49:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33306 states to 33306 states and 77488 transitions. [2019-01-13 03:49:53,150 INFO L78 Accepts]: Start accepts. Automaton has 33306 states and 77488 transitions. Word has length 113 [2019-01-13 03:49:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:53,151 INFO L480 AbstractCegarLoop]: Abstraction has 33306 states and 77488 transitions. [2019-01-13 03:49:53,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 33306 states and 77488 transitions. [2019-01-13 03:49:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 03:49:53,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:53,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:53,189 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1995927487, now seen corresponding path program 1 times [2019-01-13 03:49:53,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:53,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:53,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:53,511 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:49:53,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:53,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:49:53,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:49:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:49:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:53,513 INFO L87 Difference]: Start difference. First operand 33306 states and 77488 transitions. Second operand 7 states. [2019-01-13 03:49:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:53,778 INFO L93 Difference]: Finished difference Result 37948 states and 87935 transitions. [2019-01-13 03:49:53,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:49:53,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-01-13 03:49:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:53,820 INFO L225 Difference]: With dead ends: 37948 [2019-01-13 03:49:53,821 INFO L226 Difference]: Without dead ends: 37948 [2019-01-13 03:49:53,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:49:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37948 states. [2019-01-13 03:49:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37948 to 30618. [2019-01-13 03:49:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30618 states. [2019-01-13 03:49:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30618 states to 30618 states and 71036 transitions. [2019-01-13 03:49:54,176 INFO L78 Accepts]: Start accepts. Automaton has 30618 states and 71036 transitions. Word has length 113 [2019-01-13 03:49:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:54,176 INFO L480 AbstractCegarLoop]: Abstraction has 30618 states and 71036 transitions. [2019-01-13 03:49:54,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 30618 states and 71036 transitions. [2019-01-13 03:49:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 03:49:54,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:54,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:54,206 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash 263951935, now seen corresponding path program 1 times [2019-01-13 03:49:54,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:54,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:54,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:54,375 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:49:54,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:54,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:49:54,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:49:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:49:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:49:54,377 INFO L87 Difference]: Start difference. First operand 30618 states and 71036 transitions. Second operand 6 states. [2019-01-13 03:49:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:54,626 INFO L93 Difference]: Finished difference Result 30474 states and 70452 transitions. [2019-01-13 03:49:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:49:54,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-01-13 03:49:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:54,661 INFO L225 Difference]: With dead ends: 30474 [2019-01-13 03:49:54,662 INFO L226 Difference]: Without dead ends: 30474 [2019-01-13 03:49:54,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:49:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30474 states. [2019-01-13 03:49:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30474 to 26611. [2019-01-13 03:49:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26611 states. [2019-01-13 03:49:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26611 states to 26611 states and 61632 transitions. [2019-01-13 03:49:54,955 INFO L78 Accepts]: Start accepts. Automaton has 26611 states and 61632 transitions. Word has length 113 [2019-01-13 03:49:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:54,956 INFO L480 AbstractCegarLoop]: Abstraction has 26611 states and 61632 transitions. [2019-01-13 03:49:54,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:49:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26611 states and 61632 transitions. [2019-01-13 03:49:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 03:49:54,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:54,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:49:54,981 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:54,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:54,981 INFO L82 PathProgramCache]: Analyzing trace with hash 885076102, now seen corresponding path program 1 times [2019-01-13 03:49:54,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:54,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:54,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:54,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:55,416 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:49:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:55,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:49:55,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:49:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:49:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:49:55,418 INFO L87 Difference]: Start difference. First operand 26611 states and 61632 transitions. Second operand 6 states. [2019-01-13 03:49:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:56,119 INFO L93 Difference]: Finished difference Result 30586 states and 70246 transitions. [2019-01-13 03:49:56,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:49:56,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-01-13 03:49:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:56,156 INFO L225 Difference]: With dead ends: 30586 [2019-01-13 03:49:56,156 INFO L226 Difference]: Without dead ends: 30586 [2019-01-13 03:49:56,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:49:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30586 states. [2019-01-13 03:49:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30586 to 26698. [2019-01-13 03:49:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26698 states. [2019-01-13 03:49:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26698 states to 26698 states and 61795 transitions. [2019-01-13 03:49:56,482 INFO L78 Accepts]: Start accepts. Automaton has 26698 states and 61795 transitions. Word has length 113 [2019-01-13 03:49:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:56,483 INFO L480 AbstractCegarLoop]: Abstraction has 26698 states and 61795 transitions. [2019-01-13 03:49:56,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:49:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 26698 states and 61795 transitions. [2019-01-13 03:49:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:49:56,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:56,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:56,513 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash 871238757, now seen corresponding path program 1 times [2019-01-13 03:49:56,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:56,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:56,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:56,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:56,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:56,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:49:56,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:56,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:49:56,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:49:56,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:49:56,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:56,842 INFO L87 Difference]: Start difference. First operand 26698 states and 61795 transitions. Second operand 7 states. [2019-01-13 03:49:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:57,494 INFO L93 Difference]: Finished difference Result 35402 states and 80951 transitions. [2019-01-13 03:49:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:49:57,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-13 03:49:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:57,559 INFO L225 Difference]: With dead ends: 35402 [2019-01-13 03:49:57,559 INFO L226 Difference]: Without dead ends: 35359 [2019-01-13 03:49:57,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:49:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35359 states. [2019-01-13 03:49:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35359 to 26901. [2019-01-13 03:49:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26901 states. [2019-01-13 03:49:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26901 states to 26901 states and 62034 transitions. [2019-01-13 03:49:57,929 INFO L78 Accepts]: Start accepts. Automaton has 26901 states and 62034 transitions. Word has length 115 [2019-01-13 03:49:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:57,929 INFO L480 AbstractCegarLoop]: Abstraction has 26901 states and 62034 transitions. [2019-01-13 03:49:57,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26901 states and 62034 transitions. [2019-01-13 03:49:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:49:57,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:57,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,958 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1205970586, now seen corresponding path program 1 times [2019-01-13 03:49:57,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:57,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:57,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:57,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:57,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:58,383 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:49:58,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:58,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:49:58,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:49:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:49:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:49:58,384 INFO L87 Difference]: Start difference. First operand 26901 states and 62034 transitions. Second operand 7 states. [2019-01-13 03:49:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:59,069 INFO L93 Difference]: Finished difference Result 34449 states and 77966 transitions. [2019-01-13 03:49:59,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:49:59,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-13 03:49:59,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:49:59,110 INFO L225 Difference]: With dead ends: 34449 [2019-01-13 03:49:59,110 INFO L226 Difference]: Without dead ends: 34427 [2019-01-13 03:49:59,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:49:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34427 states. [2019-01-13 03:49:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34427 to 29879. [2019-01-13 03:49:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29879 states. [2019-01-13 03:49:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29879 states to 29879 states and 68155 transitions. [2019-01-13 03:49:59,483 INFO L78 Accepts]: Start accepts. Automaton has 29879 states and 68155 transitions. Word has length 115 [2019-01-13 03:49:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:49:59,483 INFO L480 AbstractCegarLoop]: Abstraction has 29879 states and 68155 transitions. [2019-01-13 03:49:59,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:49:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29879 states and 68155 transitions. [2019-01-13 03:49:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:49:59,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:49:59,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:59,513 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:49:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:49:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -994619673, now seen corresponding path program 1 times [2019-01-13 03:49:59,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:49:59,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:49:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:59,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:49:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:49:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:49:59,881 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:49:59,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:49:59,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:49:59,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:49:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:49:59,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:49:59,882 INFO L87 Difference]: Start difference. First operand 29879 states and 68155 transitions. Second operand 5 states. [2019-01-13 03:49:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:49:59,993 INFO L93 Difference]: Finished difference Result 29879 states and 68139 transitions. [2019-01-13 03:49:59,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:49:59,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-01-13 03:49:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:50:00,030 INFO L225 Difference]: With dead ends: 29879 [2019-01-13 03:50:00,030 INFO L226 Difference]: Without dead ends: 29879 [2019-01-13 03:50:00,030 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:50:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29879 states. [2019-01-13 03:50:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29879 to 29879. [2019-01-13 03:50:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29879 states. [2019-01-13 03:50:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29879 states to 29879 states and 68139 transitions. [2019-01-13 03:50:00,352 INFO L78 Accepts]: Start accepts. Automaton has 29879 states and 68139 transitions. Word has length 115 [2019-01-13 03:50:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:50:00,353 INFO L480 AbstractCegarLoop]: Abstraction has 29879 states and 68139 transitions. [2019-01-13 03:50:00,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:50:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 29879 states and 68139 transitions. [2019-01-13 03:50:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:50:00,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:50:00,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,386 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:50:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:50:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash -107115992, now seen corresponding path program 1 times [2019-01-13 03:50:00,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:50:00,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:50:00,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:50:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:50:00,488 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:50:00,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:50:00,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:50:00,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:50:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:50:00,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:50:00,492 INFO L87 Difference]: Start difference. First operand 29879 states and 68139 transitions. Second operand 3 states. [2019-01-13 03:50:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:50:00,798 INFO L93 Difference]: Finished difference Result 37401 states and 84689 transitions. [2019-01-13 03:50:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:50:00,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-01-13 03:50:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:50:00,873 INFO L225 Difference]: With dead ends: 37401 [2019-01-13 03:50:00,873 INFO L226 Difference]: Without dead ends: 37401 [2019-01-13 03:50:00,873 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:50:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37401 states. [2019-01-13 03:50:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37401 to 37085. [2019-01-13 03:50:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37085 states. [2019-01-13 03:50:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37085 states to 37085 states and 84000 transitions. [2019-01-13 03:50:01,460 INFO L78 Accepts]: Start accepts. Automaton has 37085 states and 84000 transitions. Word has length 115 [2019-01-13 03:50:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:50:01,461 INFO L480 AbstractCegarLoop]: Abstraction has 37085 states and 84000 transitions. [2019-01-13 03:50:01,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:50:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 37085 states and 84000 transitions. [2019-01-13 03:50:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:50:01,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:50:01,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:01,498 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:50:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:50:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1618364905, now seen corresponding path program 1 times [2019-01-13 03:50:01,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:50:01,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:50:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:50:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:50:01,796 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:50:01,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:50:01,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-13 03:50:01,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 03:50:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 03:50:01,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:50:01,798 INFO L87 Difference]: Start difference. First operand 37085 states and 84000 transitions. Second operand 14 states. [2019-01-13 03:50:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:50:02,599 INFO L93 Difference]: Finished difference Result 60700 states and 137414 transitions. [2019-01-13 03:50:02,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:50:02,600 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2019-01-13 03:50:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:50:02,666 INFO L225 Difference]: With dead ends: 60700 [2019-01-13 03:50:02,667 INFO L226 Difference]: Without dead ends: 51554 [2019-01-13 03:50:02,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-01-13 03:50:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51554 states. [2019-01-13 03:50:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51554 to 42516. [2019-01-13 03:50:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42516 states. [2019-01-13 03:50:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42516 states to 42516 states and 95789 transitions. [2019-01-13 03:50:03,197 INFO L78 Accepts]: Start accepts. Automaton has 42516 states and 95789 transitions. Word has length 115 [2019-01-13 03:50:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:50:03,197 INFO L480 AbstractCegarLoop]: Abstraction has 42516 states and 95789 transitions. [2019-01-13 03:50:03,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 03:50:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 42516 states and 95789 transitions. [2019-01-13 03:50:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:50:03,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:50:03,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:03,240 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:50:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:50:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1652705303, now seen corresponding path program 2 times [2019-01-13 03:50:03,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:50:03,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:50:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:03,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:50:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:50:03,424 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:50:03,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:50:03,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 03:50:03,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 03:50:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 03:50:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:50:03,426 INFO L87 Difference]: Start difference. First operand 42516 states and 95789 transitions. Second operand 12 states. [2019-01-13 03:50:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:50:04,336 INFO L93 Difference]: Finished difference Result 86799 states and 196372 transitions. [2019-01-13 03:50:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-13 03:50:04,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2019-01-13 03:50:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:50:04,424 INFO L225 Difference]: With dead ends: 86799 [2019-01-13 03:50:04,424 INFO L226 Difference]: Without dead ends: 67577 [2019-01-13 03:50:04,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 03:50:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67577 states. [2019-01-13 03:50:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67577 to 49595. [2019-01-13 03:50:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49595 states. [2019-01-13 03:50:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49595 states to 49595 states and 110416 transitions. [2019-01-13 03:50:05,131 INFO L78 Accepts]: Start accepts. Automaton has 49595 states and 110416 transitions. Word has length 115 [2019-01-13 03:50:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:50:05,131 INFO L480 AbstractCegarLoop]: Abstraction has 49595 states and 110416 transitions. [2019-01-13 03:50:05,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 03:50:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 49595 states and 110416 transitions. [2019-01-13 03:50:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:50:05,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:50:05,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,213 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:50:05,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:50:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -670244275, now seen corresponding path program 3 times [2019-01-13 03:50:05,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:50:05,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:50:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:05,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:50:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:50:05,878 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:50:05,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:50:05,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-13 03:50:05,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 03:50:05,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 03:50:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:50:05,880 INFO L87 Difference]: Start difference. First operand 49595 states and 110416 transitions. Second operand 16 states. [2019-01-13 03:50:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:50:07,358 INFO L93 Difference]: Finished difference Result 67836 states and 151590 transitions. [2019-01-13 03:50:07,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 03:50:07,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2019-01-13 03:50:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:50:07,431 INFO L225 Difference]: With dead ends: 67836 [2019-01-13 03:50:07,432 INFO L226 Difference]: Without dead ends: 59925 [2019-01-13 03:50:07,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=1539, Unknown=0, NotChecked=0, Total=1806 [2019-01-13 03:50:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59925 states. [2019-01-13 03:50:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59925 to 50672. [2019-01-13 03:50:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50672 states. [2019-01-13 03:50:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50672 states to 50672 states and 112850 transitions. [2019-01-13 03:50:08,124 INFO L78 Accepts]: Start accepts. Automaton has 50672 states and 112850 transitions. Word has length 115 [2019-01-13 03:50:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:50:08,124 INFO L480 AbstractCegarLoop]: Abstraction has 50672 states and 112850 transitions. [2019-01-13 03:50:08,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 03:50:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 50672 states and 112850 transitions. [2019-01-13 03:50:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:50:08,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:50:08,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,176 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:50:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:50:08,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1418655316, now seen corresponding path program 1 times [2019-01-13 03:50:08,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:50:08,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:50:08,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:08,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:50:08,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:50:08,538 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-13 03:50:08,669 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:50:08,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:50:08,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-13 03:50:08,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 03:50:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 03:50:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-01-13 03:50:08,670 INFO L87 Difference]: Start difference. First operand 50672 states and 112850 transitions. Second operand 17 states. [2019-01-13 03:50:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:50:10,132 INFO L93 Difference]: Finished difference Result 68554 states and 153480 transitions. [2019-01-13 03:50:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-13 03:50:10,134 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 115 [2019-01-13 03:50:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:50:10,209 INFO L225 Difference]: With dead ends: 68554 [2019-01-13 03:50:10,209 INFO L226 Difference]: Without dead ends: 60242 [2019-01-13 03:50:10,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 03:50:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60242 states. [2019-01-13 03:50:10,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60242 to 48464. [2019-01-13 03:50:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48464 states. [2019-01-13 03:50:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48464 states to 48464 states and 108139 transitions. [2019-01-13 03:50:10,854 INFO L78 Accepts]: Start accepts. Automaton has 48464 states and 108139 transitions. Word has length 115 [2019-01-13 03:50:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:50:10,854 INFO L480 AbstractCegarLoop]: Abstraction has 48464 states and 108139 transitions. [2019-01-13 03:50:10,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 03:50:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 48464 states and 108139 transitions. [2019-01-13 03:50:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:50:10,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:50:10,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,902 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:50:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:50:10,902 INFO L82 PathProgramCache]: Analyzing trace with hash 415062155, now seen corresponding path program 4 times [2019-01-13 03:50:10,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:50:10,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:50:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:10,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:50:10,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:50:11,201 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:50:11,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:50:11,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:50:11,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:50:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:50:11,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:50:11,202 INFO L87 Difference]: Start difference. First operand 48464 states and 108139 transitions. Second operand 10 states. [2019-01-13 03:50:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:50:11,974 INFO L93 Difference]: Finished difference Result 55641 states and 124073 transitions. [2019-01-13 03:50:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:50:11,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-01-13 03:50:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:50:11,983 INFO L225 Difference]: With dead ends: 55641 [2019-01-13 03:50:11,983 INFO L226 Difference]: Without dead ends: 5495 [2019-01-13 03:50:11,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:50:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2019-01-13 03:50:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5495. [2019-01-13 03:50:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5495 states. [2019-01-13 03:50:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 12770 transitions. [2019-01-13 03:50:12,039 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 12770 transitions. Word has length 115 [2019-01-13 03:50:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:50:12,039 INFO L480 AbstractCegarLoop]: Abstraction has 5495 states and 12770 transitions. [2019-01-13 03:50:12,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:50:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 12770 transitions. [2019-01-13 03:50:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 03:50:12,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:50:12,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,047 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:50:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:50:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1850450446, now seen corresponding path program 2 times [2019-01-13 03:50:12,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:50:12,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:50:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:12,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:50:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:50:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:50:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:50:12,160 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:50:12,341 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:50:12,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:50:12 BasicIcfg [2019-01-13 03:50:12,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:50:12,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:50:12,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:50:12,345 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:50:12,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:47:13" (3/4) ... [2019-01-13 03:50:12,352 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:50:12,546 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:50:12,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:50:12,550 INFO L168 Benchmark]: Toolchain (without parser) took 181226.21 ms. Allocated memory was 1.0 GB in the beginning and 7.5 GB in the end (delta: 6.4 GB). Free memory was 940.6 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-01-13 03:50:12,551 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:50:12,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 979.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-13 03:50:12,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 03:50:12,555 INFO L168 Benchmark]: Boogie Preprocessor took 48.69 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:50:12,555 INFO L168 Benchmark]: RCFGBuilder took 1424.47 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-01-13 03:50:12,555 INFO L168 Benchmark]: TraceAbstraction took 178478.52 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-01-13 03:50:12,560 INFO L168 Benchmark]: Witness Printer took 203.95 ms. Allocated memory is still 7.5 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:50:12,562 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 979.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.69 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 1424.47 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: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 178478.52 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 203.95 ms. Allocated memory is still 7.5 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] -1 pthread_t t1727; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK -1 pthread_create(&t1727, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] -1 pthread_t t1728; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK -1 pthread_create(&t1728, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$w_buff1 = x$w_buff0 [L707] 0 x$w_buff0 = 1 [L708] 0 x$w_buff1_used = x$w_buff0_used [L709] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L711] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L712] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L713] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L714] 0 x$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 x$flush_delayed = weak$$choice2 [L720] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L722] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L723] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L724] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 x = x$flush_delayed ? x$mem_tmp : x [L730] 0 x$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 y = 1 [L753] 1 __unbuffered_p1_EAX = y [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L804] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L805] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L805] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L806] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L807] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L807] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 178.2s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 55.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18066 SDtfs, 22714 SDslu, 66001 SDs, 0 SdLazy, 14733 SolverSat, 1015 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 510 GetRequests, 105 SyntacticMatches, 26 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, 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: 99.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 837305 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 3404 NumberOfCodeBlocks, 3404 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3252 ConstructedInterpolants, 0 QuantifiedInterpolants, 932338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...