./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix000_rmo.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/mix000_rmo.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 7a89974c080718a05b9cfe62a5ae979ce71efdb8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 22:27:59,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:27:59,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:27:59,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:27:59,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:27:59,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:27:59,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:27:59,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:27:59,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:27:59,130 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:27:59,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:27:59,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:27:59,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:27:59,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:27:59,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:27:59,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:27:59,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:27:59,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:27:59,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:27:59,144 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:27:59,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:27:59,147 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:27:59,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:27:59,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:27:59,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:27:59,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:27:59,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:27:59,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:27:59,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:27:59,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:27:59,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:27:59,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:27:59,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:27:59,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:27:59,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:27:59,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:27:59,160 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 22:27:59,175 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:27:59,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:27:59,177 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:27:59,177 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:27:59,178 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:27:59,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:27:59,178 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:27:59,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:27:59,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:27:59,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:27:59,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:27:59,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:27:59,179 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:27:59,179 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:27:59,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:27:59,180 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:27:59,180 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:27:59,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:27:59,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:27:59,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:27:59,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:27:59,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:27:59,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:27:59,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:27:59,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:27:59,181 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:27:59,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:27:59,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:27:59,184 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 -> 7a89974c080718a05b9cfe62a5ae979ce71efdb8 [2019-01-12 22:27:59,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:27:59,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:27:59,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:27:59,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:27:59,259 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:27:59,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix000_rmo.oepc_false-unreach-call.i [2019-01-12 22:27:59,328 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34b67e8f/6165062f7080497aaa2d1ec281439962/FLAG4a9fb11f8 [2019-01-12 22:27:59,912 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:27:59,913 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix000_rmo.oepc_false-unreach-call.i [2019-01-12 22:27:59,931 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34b67e8f/6165062f7080497aaa2d1ec281439962/FLAG4a9fb11f8 [2019-01-12 22:28:00,187 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34b67e8f/6165062f7080497aaa2d1ec281439962 [2019-01-12 22:28:00,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:28:00,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:28:00,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:28:00,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:28:00,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:28:00,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:00,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c23ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00, skipping insertion in model container [2019-01-12 22:28:00,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:00,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:28:00,284 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:28:00,700 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:28:00,719 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:28:00,911 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:28:00,995 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:28:00,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00 WrapperNode [2019-01-12 22:28:00,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:28:00,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:28:00,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:28:00,998 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:28:01,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:28:01,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:28:01,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:28:01,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:28:01,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... [2019-01-12 22:28:01,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:28:01,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:28:01,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:28:01,126 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:28:01,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:28:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:28:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 22:28:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:28:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:28:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 22:28:01,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 22:28:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 22:28:01,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 22:28:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 22:28:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:28:01,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:28:01,204 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 22:28:02,601 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:28:02,601 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 22:28:02,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:02 BoogieIcfgContainer [2019-01-12 22:28:02,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:28:02,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:28:02,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:28:02,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:28:02,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:28:00" (1/3) ... [2019-01-12 22:28:02,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6b2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:28:02, skipping insertion in model container [2019-01-12 22:28:02,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:00" (2/3) ... [2019-01-12 22:28:02,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6b2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:28:02, skipping insertion in model container [2019-01-12 22:28:02,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:02" (3/3) ... [2019-01-12 22:28:02,612 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc_false-unreach-call.i [2019-01-12 22:28:02,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,661 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,661 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,661 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,662 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,662 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,679 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,680 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,681 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,682 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,683 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,684 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,688 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,726 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,726 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,729 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:02,783 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:28:02,783 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:28:02,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 22:28:02,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 22:28:02,843 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:28:02,844 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:28:02,844 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:28:02,844 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:28:02,844 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:28:02,844 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:28:02,844 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:28:02,844 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:28:02,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:28:02,861 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2019-01-12 22:28:15,516 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2019-01-12 22:28:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2019-01-12 22:28:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 22:28:15,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:15,531 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-12 22:28:15,533 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:15,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1413658612, now seen corresponding path program 1 times [2019-01-12 22:28:15,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:15,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:15,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:15,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:15,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:15,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:16,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:16,017 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2019-01-12 22:28:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:18,539 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2019-01-12 22:28:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:28:18,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-12 22:28:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:19,569 INFO L225 Difference]: With dead ends: 192000 [2019-01-12 22:28:19,569 INFO L226 Difference]: Without dead ends: 135832 [2019-01-12 22:28:19,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2019-01-12 22:28:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2019-01-12 22:28:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2019-01-12 22:28:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2019-01-12 22:28:30,439 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2019-01-12 22:28:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:30,440 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2019-01-12 22:28:30,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2019-01-12 22:28:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 22:28:30,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:30,454 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-12 22:28:30,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:30,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:30,455 INFO L82 PathProgramCache]: Analyzing trace with hash 512759921, now seen corresponding path program 1 times [2019-01-12 22:28:30,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:30,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:30,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:30,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:30,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:30,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:30,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:30,594 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2019-01-12 22:28:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:33,794 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2019-01-12 22:28:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:28:33,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 22:28:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:34,753 INFO L225 Difference]: With dead ends: 195844 [2019-01-12 22:28:34,753 INFO L226 Difference]: Without dead ends: 195292 [2019-01-12 22:28:34,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:28:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2019-01-12 22:28:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2019-01-12 22:28:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2019-01-12 22:28:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2019-01-12 22:28:40,843 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2019-01-12 22:28:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:40,844 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2019-01-12 22:28:40,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2019-01-12 22:28:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 22:28:40,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:40,850 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-12 22:28:40,851 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:40,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1044252158, now seen corresponding path program 1 times [2019-01-12 22:28:40,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:40,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:40,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:40,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:40,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:40,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:40,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:40,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:40,964 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2019-01-12 22:28:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:44,674 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2019-01-12 22:28:44,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:28:44,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 22:28:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:45,497 INFO L225 Difference]: With dead ends: 253868 [2019-01-12 22:28:45,497 INFO L226 Difference]: Without dead ends: 253356 [2019-01-12 22:28:45,497 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-12 22:28:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2019-01-12 22:28:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2019-01-12 22:28:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2019-01-12 22:28:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2019-01-12 22:28:57,869 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2019-01-12 22:28:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:57,870 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2019-01-12 22:28:57,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2019-01-12 22:28:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:28:57,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:57,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:57,884 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1766694552, now seen corresponding path program 1 times [2019-01-12 22:28:57,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:58,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:28:58,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:28:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:28:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:58,015 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2019-01-12 22:28:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:59,272 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2019-01-12 22:28:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:28:59,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-12 22:28:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:00,017 INFO L225 Difference]: With dead ends: 234162 [2019-01-12 22:29:00,017 INFO L226 Difference]: Without dead ends: 234162 [2019-01-12 22:29:00,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2019-01-12 22:29:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2019-01-12 22:29:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2019-01-12 22:29:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2019-01-12 22:29:09,713 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2019-01-12 22:29:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:09,713 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2019-01-12 22:29:09,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:29:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2019-01-12 22:29:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:29:09,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:09,740 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-12 22:29:09,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:09,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1751055411, now seen corresponding path program 1 times [2019-01-12 22:29:09,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:09,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:09,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:10,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:10,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:10,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:10,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:10,097 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2019-01-12 22:29:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:13,242 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2019-01-12 22:29:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:29:13,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-12 22:29:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:14,541 INFO L225 Difference]: With dead ends: 402833 [2019-01-12 22:29:14,541 INFO L226 Difference]: Without dead ends: 402257 [2019-01-12 22:29:14,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:29:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2019-01-12 22:29:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2019-01-12 22:29:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2019-01-12 22:29:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2019-01-12 22:29:33,677 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2019-01-12 22:29:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:33,678 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2019-01-12 22:29:33,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2019-01-12 22:29:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:29:33,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:33,701 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-12 22:29:33,701 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash 8397738, now seen corresponding path program 1 times [2019-01-12 22:29:33,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:33,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:33,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:33,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:33,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:29:33,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:29:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:29:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:33,861 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2019-01-12 22:29:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:37,574 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2019-01-12 22:29:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:29:37,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-12 22:29:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:40,499 INFO L225 Difference]: With dead ends: 325852 [2019-01-12 22:29:40,500 INFO L226 Difference]: Without dead ends: 325852 [2019-01-12 22:29:40,500 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-12 22:29:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2019-01-12 22:29:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2019-01-12 22:29:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2019-01-12 22:29:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2019-01-12 22:29:57,068 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2019-01-12 22:29:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:57,069 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2019-01-12 22:29:57,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:29:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2019-01-12 22:29:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:29:57,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:57,100 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-12 22:29:57,100 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash 895901419, now seen corresponding path program 1 times [2019-01-12 22:29:57,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:57,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:57,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:57,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:57,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:29:57,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:29:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:29:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:57,274 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 4 states. [2019-01-12 22:29:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:57,475 INFO L93 Difference]: Finished difference Result 40004 states and 128000 transitions. [2019-01-12 22:29:57,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:29:57,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-12 22:29:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:57,535 INFO L225 Difference]: With dead ends: 40004 [2019-01-12 22:29:57,535 INFO L226 Difference]: Without dead ends: 32121 [2019-01-12 22:29:57,536 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-12 22:29:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32121 states. [2019-01-12 22:29:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32121 to 31856. [2019-01-12 22:29:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31856 states. [2019-01-12 22:29:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31856 states to 31856 states and 99339 transitions. [2019-01-12 22:29:58,009 INFO L78 Accepts]: Start accepts. Automaton has 31856 states and 99339 transitions. Word has length 54 [2019-01-12 22:29:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:58,009 INFO L480 AbstractCegarLoop]: Abstraction has 31856 states and 99339 transitions. [2019-01-12 22:29:58,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:29:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 31856 states and 99339 transitions. [2019-01-12 22:29:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 22:29:58,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:58,015 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-12 22:29:58,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 642841615, now seen corresponding path program 1 times [2019-01-12 22:29:58,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:58,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:58,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:58,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:58,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:29:58,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:29:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:29:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:58,124 INFO L87 Difference]: Start difference. First operand 31856 states and 99339 transitions. Second operand 4 states. [2019-01-12 22:29:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:58,490 INFO L93 Difference]: Finished difference Result 37101 states and 115387 transitions. [2019-01-12 22:29:58,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:29:58,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-01-12 22:29:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:58,555 INFO L225 Difference]: With dead ends: 37101 [2019-01-12 22:29:58,555 INFO L226 Difference]: Without dead ends: 37101 [2019-01-12 22:29:58,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:29:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37101 states. [2019-01-12 22:30:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37101 to 36125. [2019-01-12 22:30:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36125 states. [2019-01-12 22:30:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36125 states to 36125 states and 112472 transitions. [2019-01-12 22:30:00,829 INFO L78 Accepts]: Start accepts. Automaton has 36125 states and 112472 transitions. Word has length 62 [2019-01-12 22:30:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:00,829 INFO L480 AbstractCegarLoop]: Abstraction has 36125 states and 112472 transitions. [2019-01-12 22:30:00,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:30:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 36125 states and 112472 transitions. [2019-01-12 22:30:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 22:30:00,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:00,836 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-12 22:30:00,837 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1909315346, now seen corresponding path program 1 times [2019-01-12 22:30:00,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:00,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:00,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:00,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:00,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:30:01,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:30:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:30:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:30:01,122 INFO L87 Difference]: Start difference. First operand 36125 states and 112472 transitions. Second operand 6 states. [2019-01-12 22:30:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:02,178 INFO L93 Difference]: Finished difference Result 74227 states and 229198 transitions. [2019-01-12 22:30:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:30:02,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-01-12 22:30:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:02,337 INFO L225 Difference]: With dead ends: 74227 [2019-01-12 22:30:02,337 INFO L226 Difference]: Without dead ends: 74156 [2019-01-12 22:30:02,337 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-12 22:30:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74156 states. [2019-01-12 22:30:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74156 to 44213. [2019-01-12 22:30:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44213 states. [2019-01-12 22:30:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44213 states to 44213 states and 135208 transitions. [2019-01-12 22:30:03,192 INFO L78 Accepts]: Start accepts. Automaton has 44213 states and 135208 transitions. Word has length 62 [2019-01-12 22:30:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:03,193 INFO L480 AbstractCegarLoop]: Abstraction has 44213 states and 135208 transitions. [2019-01-12 22:30:03,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:30:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44213 states and 135208 transitions. [2019-01-12 22:30:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-12 22:30:03,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:03,203 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-12 22:30:03,204 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash -941424289, now seen corresponding path program 1 times [2019-01-12 22:30:03,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:03,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:03,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:03,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:03,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:30:03,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:30:03,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:30:03,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:03,286 INFO L87 Difference]: Start difference. First operand 44213 states and 135208 transitions. Second operand 3 states. [2019-01-12 22:30:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:03,619 INFO L93 Difference]: Finished difference Result 55070 states and 166417 transitions. [2019-01-12 22:30:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:30:03,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-12 22:30:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:03,721 INFO L225 Difference]: With dead ends: 55070 [2019-01-12 22:30:03,722 INFO L226 Difference]: Without dead ends: 55070 [2019-01-12 22:30:03,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55070 states. [2019-01-12 22:30:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55070 to 45329. [2019-01-12 22:30:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45329 states. [2019-01-12 22:30:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45329 states to 45329 states and 135858 transitions. [2019-01-12 22:30:04,421 INFO L78 Accepts]: Start accepts. Automaton has 45329 states and 135858 transitions. Word has length 68 [2019-01-12 22:30:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:04,422 INFO L480 AbstractCegarLoop]: Abstraction has 45329 states and 135858 transitions. [2019-01-12 22:30:04,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:30:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 45329 states and 135858 transitions. [2019-01-12 22:30:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 22:30:04,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:04,437 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-12 22:30:04,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash 53745586, now seen corresponding path program 1 times [2019-01-12 22:30:04,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:04,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:04,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:04,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:04,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:30:04,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:30:04,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:30:04,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:30:04,790 INFO L87 Difference]: Start difference. First operand 45329 states and 135858 transitions. Second operand 5 states. [2019-01-12 22:30:05,723 WARN L181 SmtUtils]: Spent 823.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-01-12 22:30:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:06,341 INFO L93 Difference]: Finished difference Result 51158 states and 153082 transitions. [2019-01-12 22:30:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:30:06,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-01-12 22:30:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:06,420 INFO L225 Difference]: With dead ends: 51158 [2019-01-12 22:30:06,420 INFO L226 Difference]: Without dead ends: 51158 [2019-01-12 22:30:06,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:30:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2019-01-12 22:30:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 45794. [2019-01-12 22:30:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45794 states. [2019-01-12 22:30:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45794 states to 45794 states and 137141 transitions. [2019-01-12 22:30:07,099 INFO L78 Accepts]: Start accepts. Automaton has 45794 states and 137141 transitions. Word has length 74 [2019-01-12 22:30:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:07,100 INFO L480 AbstractCegarLoop]: Abstraction has 45794 states and 137141 transitions. [2019-01-12 22:30:07,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:30:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45794 states and 137141 transitions. [2019-01-12 22:30:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 22:30:07,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:07,115 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-12 22:30:07,116 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:07,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555921, now seen corresponding path program 1 times [2019-01-12 22:30:07,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:07,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:07,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:07,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:07,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:07,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:07,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:07,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:07,538 INFO L87 Difference]: Start difference. First operand 45794 states and 137141 transitions. Second operand 7 states. [2019-01-12 22:30:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:08,752 INFO L93 Difference]: Finished difference Result 54436 states and 163097 transitions. [2019-01-12 22:30:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:30:08,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-01-12 22:30:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:08,839 INFO L225 Difference]: With dead ends: 54436 [2019-01-12 22:30:08,839 INFO L226 Difference]: Without dead ends: 54349 [2019-01-12 22:30:08,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:30:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54349 states. [2019-01-12 22:30:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54349 to 42854. [2019-01-12 22:30:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42854 states. [2019-01-12 22:30:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42854 states to 42854 states and 129588 transitions. [2019-01-12 22:30:09,509 INFO L78 Accepts]: Start accepts. Automaton has 42854 states and 129588 transitions. Word has length 74 [2019-01-12 22:30:09,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:09,510 INFO L480 AbstractCegarLoop]: Abstraction has 42854 states and 129588 transitions. [2019-01-12 22:30:09,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:09,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42854 states and 129588 transitions. [2019-01-12 22:30:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 22:30:09,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:09,524 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-12 22:30:09,524 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash -744614695, now seen corresponding path program 1 times [2019-01-12 22:30:09,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:09,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:09,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:09,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:30:09,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:30:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:30:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:30:09,632 INFO L87 Difference]: Start difference. First operand 42854 states and 129588 transitions. Second operand 4 states. [2019-01-12 22:30:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:10,596 INFO L93 Difference]: Finished difference Result 56907 states and 168235 transitions. [2019-01-12 22:30:10,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:30:10,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-12 22:30:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:10,688 INFO L225 Difference]: With dead ends: 56907 [2019-01-12 22:30:10,688 INFO L226 Difference]: Without dead ends: 56907 [2019-01-12 22:30:10,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:30:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56907 states. [2019-01-12 22:30:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56907 to 51423. [2019-01-12 22:30:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51423 states. [2019-01-12 22:30:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51423 states to 51423 states and 153222 transitions. [2019-01-12 22:30:11,701 INFO L78 Accepts]: Start accepts. Automaton has 51423 states and 153222 transitions. Word has length 76 [2019-01-12 22:30:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:11,702 INFO L480 AbstractCegarLoop]: Abstraction has 51423 states and 153222 transitions. [2019-01-12 22:30:11,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:30:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 51423 states and 153222 transitions. [2019-01-12 22:30:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 22:30:11,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:11,720 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-12 22:30:11,720 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 608695002, now seen corresponding path program 1 times [2019-01-12 22:30:11,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:11,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:11,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:11,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:11,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:30:11,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:30:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:30:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:30:11,946 INFO L87 Difference]: Start difference. First operand 51423 states and 153222 transitions. Second operand 5 states. [2019-01-12 22:30:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:12,033 INFO L93 Difference]: Finished difference Result 17475 states and 44301 transitions. [2019-01-12 22:30:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:30:12,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-12 22:30:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:12,053 INFO L225 Difference]: With dead ends: 17475 [2019-01-12 22:30:12,053 INFO L226 Difference]: Without dead ends: 15747 [2019-01-12 22:30:12,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15747 states. [2019-01-12 22:30:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15747 to 15447. [2019-01-12 22:30:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15447 states. [2019-01-12 22:30:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15447 states to 15447 states and 38567 transitions. [2019-01-12 22:30:12,240 INFO L78 Accepts]: Start accepts. Automaton has 15447 states and 38567 transitions. Word has length 76 [2019-01-12 22:30:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:12,241 INFO L480 AbstractCegarLoop]: Abstraction has 15447 states and 38567 transitions. [2019-01-12 22:30:12,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:30:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 15447 states and 38567 transitions. [2019-01-12 22:30:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 22:30:12,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:12,261 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] [2019-01-12 22:30:12,261 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 561809011, now seen corresponding path program 1 times [2019-01-12 22:30:12,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:12,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:12,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:12,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:12,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:12,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:12,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:30:12,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:30:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:30:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:30:12,504 INFO L87 Difference]: Start difference. First operand 15447 states and 38567 transitions. Second operand 4 states. [2019-01-12 22:30:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:12,676 INFO L93 Difference]: Finished difference Result 17208 states and 42054 transitions. [2019-01-12 22:30:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:30:12,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-01-12 22:30:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:12,697 INFO L225 Difference]: With dead ends: 17208 [2019-01-12 22:30:12,697 INFO L226 Difference]: Without dead ends: 17188 [2019-01-12 22:30:12,698 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-12 22:30:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17188 states. [2019-01-12 22:30:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17188 to 16797. [2019-01-12 22:30:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16797 states. [2019-01-12 22:30:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16797 states to 16797 states and 41137 transitions. [2019-01-12 22:30:12,905 INFO L78 Accepts]: Start accepts. Automaton has 16797 states and 41137 transitions. Word has length 109 [2019-01-12 22:30:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:12,906 INFO L480 AbstractCegarLoop]: Abstraction has 16797 states and 41137 transitions. [2019-01-12 22:30:12,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:30:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 16797 states and 41137 transitions. [2019-01-12 22:30:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:30:12,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:12,931 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-12 22:30:12,931 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1024543284, now seen corresponding path program 1 times [2019-01-12 22:30:12,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:12,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:13,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:13,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:30:13,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:30:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:30:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:30:13,312 INFO L87 Difference]: Start difference. First operand 16797 states and 41137 transitions. Second operand 5 states. [2019-01-12 22:30:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:13,879 INFO L93 Difference]: Finished difference Result 20148 states and 48712 transitions. [2019-01-12 22:30:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:30:13,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 22:30:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:13,906 INFO L225 Difference]: With dead ends: 20148 [2019-01-12 22:30:13,906 INFO L226 Difference]: Without dead ends: 20148 [2019-01-12 22:30:13,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20148 states. [2019-01-12 22:30:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20148 to 15895. [2019-01-12 22:30:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15895 states. [2019-01-12 22:30:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15895 states to 15895 states and 38426 transitions. [2019-01-12 22:30:14,106 INFO L78 Accepts]: Start accepts. Automaton has 15895 states and 38426 transitions. Word has length 111 [2019-01-12 22:30:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:14,106 INFO L480 AbstractCegarLoop]: Abstraction has 15895 states and 38426 transitions. [2019-01-12 22:30:14,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:30:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 15895 states and 38426 transitions. [2019-01-12 22:30:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:30:14,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:14,124 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-12 22:30:14,124 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:14,124 INFO L82 PathProgramCache]: Analyzing trace with hash 962269671, now seen corresponding path program 1 times [2019-01-12 22:30:14,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:14,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:14,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:14,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:14,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:14,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:14,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:30:14,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:30:14,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:30:14,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:30:14,256 INFO L87 Difference]: Start difference. First operand 15895 states and 38426 transitions. Second operand 5 states. [2019-01-12 22:30:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:16,801 INFO L93 Difference]: Finished difference Result 33814 states and 81474 transitions. [2019-01-12 22:30:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:30:16,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 22:30:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:16,844 INFO L225 Difference]: With dead ends: 33814 [2019-01-12 22:30:16,844 INFO L226 Difference]: Without dead ends: 33780 [2019-01-12 22:30:16,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33780 states. [2019-01-12 22:30:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33780 to 19794. [2019-01-12 22:30:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19794 states. [2019-01-12 22:30:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19794 states to 19794 states and 48286 transitions. [2019-01-12 22:30:17,163 INFO L78 Accepts]: Start accepts. Automaton has 19794 states and 48286 transitions. Word has length 111 [2019-01-12 22:30:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:17,164 INFO L480 AbstractCegarLoop]: Abstraction has 19794 states and 48286 transitions. [2019-01-12 22:30:17,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:30:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19794 states and 48286 transitions. [2019-01-12 22:30:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:30:17,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:17,184 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-12 22:30:17,185 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1590085932, now seen corresponding path program 1 times [2019-01-12 22:30:17,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:17,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:17,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:17,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:30:17,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:30:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:30:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:30:17,393 INFO L87 Difference]: Start difference. First operand 19794 states and 48286 transitions. Second operand 4 states. [2019-01-12 22:30:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:17,658 INFO L93 Difference]: Finished difference Result 21518 states and 52097 transitions. [2019-01-12 22:30:17,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:30:17,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-01-12 22:30:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:17,686 INFO L225 Difference]: With dead ends: 21518 [2019-01-12 22:30:17,686 INFO L226 Difference]: Without dead ends: 21498 [2019-01-12 22:30:17,687 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-12 22:30:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21498 states. [2019-01-12 22:30:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21498 to 20735. [2019-01-12 22:30:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-01-12 22:30:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 50383 transitions. [2019-01-12 22:30:18,061 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 50383 transitions. Word has length 111 [2019-01-12 22:30:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:18,061 INFO L480 AbstractCegarLoop]: Abstraction has 20735 states and 50383 transitions. [2019-01-12 22:30:18,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:30:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 50383 transitions. [2019-01-12 22:30:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:30:18,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:18,085 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-12 22:30:18,085 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash -487123411, now seen corresponding path program 1 times [2019-01-12 22:30:18,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:18,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:18,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-12 22:30:18,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:18,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 22:30:18,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:30:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:30:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:30:18,418 INFO L87 Difference]: Start difference. First operand 20735 states and 50383 transitions. Second operand 8 states. [2019-01-12 22:30:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:19,719 INFO L93 Difference]: Finished difference Result 33891 states and 79934 transitions. [2019-01-12 22:30:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:30:19,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-01-12 22:30:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:19,758 INFO L225 Difference]: With dead ends: 33891 [2019-01-12 22:30:19,758 INFO L226 Difference]: Without dead ends: 33808 [2019-01-12 22:30:19,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:30:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33808 states. [2019-01-12 22:30:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33808 to 28983. [2019-01-12 22:30:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28983 states. [2019-01-12 22:30:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28983 states to 28983 states and 68882 transitions. [2019-01-12 22:30:20,131 INFO L78 Accepts]: Start accepts. Automaton has 28983 states and 68882 transitions. Word has length 111 [2019-01-12 22:30:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:20,132 INFO L480 AbstractCegarLoop]: Abstraction has 28983 states and 68882 transitions. [2019-01-12 22:30:20,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:30:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 28983 states and 68882 transitions. [2019-01-12 22:30:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:30:20,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:20,162 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-12 22:30:20,162 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash -741859956, now seen corresponding path program 1 times [2019-01-12 22:30:20,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:21,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:21,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:21,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:21,019 INFO L87 Difference]: Start difference. First operand 28983 states and 68882 transitions. Second operand 7 states. [2019-01-12 22:30:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:22,156 INFO L93 Difference]: Finished difference Result 40496 states and 94892 transitions. [2019-01-12 22:30:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:30:22,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2019-01-12 22:30:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:22,202 INFO L225 Difference]: With dead ends: 40496 [2019-01-12 22:30:22,202 INFO L226 Difference]: Without dead ends: 40496 [2019-01-12 22:30:22,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:30:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40496 states. [2019-01-12 22:30:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40496 to 33902. [2019-01-12 22:30:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33902 states. [2019-01-12 22:30:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33902 states to 33902 states and 79895 transitions. [2019-01-12 22:30:22,654 INFO L78 Accepts]: Start accepts. Automaton has 33902 states and 79895 transitions. Word has length 111 [2019-01-12 22:30:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:22,654 INFO L480 AbstractCegarLoop]: Abstraction has 33902 states and 79895 transitions. [2019-01-12 22:30:22,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 33902 states and 79895 transitions. [2019-01-12 22:30:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:30:22,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:22,690 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-12 22:30:22,690 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1491337810, now seen corresponding path program 2 times [2019-01-12 22:30:22,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:22,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:22,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:22,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:22,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:22,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:30:22,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:30:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:30:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:30:22,851 INFO L87 Difference]: Start difference. First operand 33902 states and 79895 transitions. Second operand 5 states. [2019-01-12 22:30:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:23,289 INFO L93 Difference]: Finished difference Result 36867 states and 86336 transitions. [2019-01-12 22:30:23,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:30:23,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 22:30:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:23,334 INFO L225 Difference]: With dead ends: 36867 [2019-01-12 22:30:23,334 INFO L226 Difference]: Without dead ends: 36867 [2019-01-12 22:30:23,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36867 states. [2019-01-12 22:30:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36867 to 34465. [2019-01-12 22:30:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34465 states. [2019-01-12 22:30:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 81150 transitions. [2019-01-12 22:30:23,785 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 81150 transitions. Word has length 111 [2019-01-12 22:30:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:23,785 INFO L480 AbstractCegarLoop]: Abstraction has 34465 states and 81150 transitions. [2019-01-12 22:30:23,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:30:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 81150 transitions. [2019-01-12 22:30:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:30:23,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:23,825 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-12 22:30:23,825 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1009887957, now seen corresponding path program 1 times [2019-01-12 22:30:23,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:23,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:23,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:30:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:24,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:24,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:24,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:24,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:24,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:24,099 INFO L87 Difference]: Start difference. First operand 34465 states and 81150 transitions. Second operand 7 states. [2019-01-12 22:30:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:25,434 INFO L93 Difference]: Finished difference Result 42312 states and 99646 transitions. [2019-01-12 22:30:25,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:30:25,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-01-12 22:30:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:25,481 INFO L225 Difference]: With dead ends: 42312 [2019-01-12 22:30:25,481 INFO L226 Difference]: Without dead ends: 42312 [2019-01-12 22:30:25,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:30:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42312 states. [2019-01-12 22:30:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42312 to 36544. [2019-01-12 22:30:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36544 states. [2019-01-12 22:30:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36544 states to 36544 states and 86324 transitions. [2019-01-12 22:30:25,967 INFO L78 Accepts]: Start accepts. Automaton has 36544 states and 86324 transitions. Word has length 113 [2019-01-12 22:30:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:25,968 INFO L480 AbstractCegarLoop]: Abstraction has 36544 states and 86324 transitions. [2019-01-12 22:30:25,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 36544 states and 86324 transitions. [2019-01-12 22:30:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:30:26,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:26,006 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-12 22:30:26,007 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1435552664, now seen corresponding path program 1 times [2019-01-12 22:30:26,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:26,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:26,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:26,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:26,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:26,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:26,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:26,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:26,499 INFO L87 Difference]: Start difference. First operand 36544 states and 86324 transitions. Second operand 7 states. [2019-01-12 22:30:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:27,090 INFO L93 Difference]: Finished difference Result 47580 states and 111089 transitions. [2019-01-12 22:30:27,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:30:27,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-01-12 22:30:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:27,144 INFO L225 Difference]: With dead ends: 47580 [2019-01-12 22:30:27,145 INFO L226 Difference]: Without dead ends: 47580 [2019-01-12 22:30:27,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:30:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47580 states. [2019-01-12 22:30:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47580 to 39386. [2019-01-12 22:30:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39386 states. [2019-01-12 22:30:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39386 states to 39386 states and 92753 transitions. [2019-01-12 22:30:27,726 INFO L78 Accepts]: Start accepts. Automaton has 39386 states and 92753 transitions. Word has length 113 [2019-01-12 22:30:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:27,726 INFO L480 AbstractCegarLoop]: Abstraction has 39386 states and 92753 transitions. [2019-01-12 22:30:27,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39386 states and 92753 transitions. [2019-01-12 22:30:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:30:27,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:27,768 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-12 22:30:27,768 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash -641656679, now seen corresponding path program 1 times [2019-01-12 22:30:27,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:27,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:27,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:27,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:27,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:28,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-12 22:30:28,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:28,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 22:30:28,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:30:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:30:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:30:28,094 INFO L87 Difference]: Start difference. First operand 39386 states and 92753 transitions. Second operand 8 states. [2019-01-12 22:30:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:29,313 INFO L93 Difference]: Finished difference Result 56100 states and 131786 transitions. [2019-01-12 22:30:29,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 22:30:29,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2019-01-12 22:30:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:29,387 INFO L225 Difference]: With dead ends: 56100 [2019-01-12 22:30:29,387 INFO L226 Difference]: Without dead ends: 56100 [2019-01-12 22:30:29,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:30:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56100 states. [2019-01-12 22:30:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56100 to 43726. [2019-01-12 22:30:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43726 states. [2019-01-12 22:30:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43726 states to 43726 states and 102884 transitions. [2019-01-12 22:30:29,991 INFO L78 Accepts]: Start accepts. Automaton has 43726 states and 102884 transitions. Word has length 113 [2019-01-12 22:30:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:29,991 INFO L480 AbstractCegarLoop]: Abstraction has 43726 states and 102884 transitions. [2019-01-12 22:30:29,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:30:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 43726 states and 102884 transitions. [2019-01-12 22:30:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:30:30,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:30,033 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-12 22:30:30,034 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash 245847002, now seen corresponding path program 1 times [2019-01-12 22:30:30,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:30,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:30,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:30,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:30,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:30:30,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:30:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:30:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:30,166 INFO L87 Difference]: Start difference. First operand 43726 states and 102884 transitions. Second operand 3 states. [2019-01-12 22:30:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:30,318 INFO L93 Difference]: Finished difference Result 43502 states and 102180 transitions. [2019-01-12 22:30:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:30:30,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-01-12 22:30:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:30,369 INFO L225 Difference]: With dead ends: 43502 [2019-01-12 22:30:30,369 INFO L226 Difference]: Without dead ends: 43502 [2019-01-12 22:30:30,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43502 states. [2019-01-12 22:30:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43502 to 38946. [2019-01-12 22:30:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38946 states. [2019-01-12 22:30:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38946 states to 38946 states and 91669 transitions. [2019-01-12 22:30:31,072 INFO L78 Accepts]: Start accepts. Automaton has 38946 states and 91669 transitions. Word has length 113 [2019-01-12 22:30:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:31,073 INFO L480 AbstractCegarLoop]: Abstraction has 38946 states and 91669 transitions. [2019-01-12 22:30:31,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:30:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 38946 states and 91669 transitions. [2019-01-12 22:30:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:30:31,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:31,113 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-12 22:30:31,114 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1950153343, now seen corresponding path program 1 times [2019-01-12 22:30:31,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:31,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:31,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:31,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:30:31,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:30:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:30:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:30:31,521 INFO L87 Difference]: Start difference. First operand 38946 states and 91669 transitions. Second operand 10 states. [2019-01-12 22:30:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:32,622 INFO L93 Difference]: Finished difference Result 49998 states and 115495 transitions. [2019-01-12 22:30:32,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:30:32,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-01-12 22:30:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:32,686 INFO L225 Difference]: With dead ends: 49998 [2019-01-12 22:30:32,686 INFO L226 Difference]: Without dead ends: 49998 [2019-01-12 22:30:32,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:30:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49998 states. [2019-01-12 22:30:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49998 to 42128. [2019-01-12 22:30:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42128 states. [2019-01-12 22:30:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42128 states to 42128 states and 98260 transitions. [2019-01-12 22:30:33,253 INFO L78 Accepts]: Start accepts. Automaton has 42128 states and 98260 transitions. Word has length 113 [2019-01-12 22:30:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:33,254 INFO L480 AbstractCegarLoop]: Abstraction has 42128 states and 98260 transitions. [2019-01-12 22:30:33,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:30:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 42128 states and 98260 transitions. [2019-01-12 22:30:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:30:33,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:33,295 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-12 22:30:33,295 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1068991400, now seen corresponding path program 1 times [2019-01-12 22:30:33,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:33,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:33,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:33,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:33,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:33,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:30:33,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:30:33,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:30:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:30:33,557 INFO L87 Difference]: Start difference. First operand 42128 states and 98260 transitions. Second operand 6 states. [2019-01-12 22:30:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:34,195 INFO L93 Difference]: Finished difference Result 46480 states and 107771 transitions. [2019-01-12 22:30:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:30:34,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-01-12 22:30:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:34,255 INFO L225 Difference]: With dead ends: 46480 [2019-01-12 22:30:34,255 INFO L226 Difference]: Without dead ends: 46480 [2019-01-12 22:30:34,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:30:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46480 states. [2019-01-12 22:30:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46480 to 42003. [2019-01-12 22:30:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42003 states. [2019-01-12 22:30:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42003 states to 42003 states and 97979 transitions. [2019-01-12 22:30:34,820 INFO L78 Accepts]: Start accepts. Automaton has 42003 states and 97979 transitions. Word has length 113 [2019-01-12 22:30:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:34,821 INFO L480 AbstractCegarLoop]: Abstraction has 42003 states and 97979 transitions. [2019-01-12 22:30:34,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:30:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 42003 states and 97979 transitions. [2019-01-12 22:30:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:34,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:34,861 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-12 22:30:34,862 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash 303190561, now seen corresponding path program 1 times [2019-01-12 22:30:34,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:34,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:34,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:35,451 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 22:30:35,868 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-12 22:30:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:35,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:35,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:35,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:35,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:35,885 INFO L87 Difference]: Start difference. First operand 42003 states and 97979 transitions. Second operand 7 states. [2019-01-12 22:30:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:36,420 INFO L93 Difference]: Finished difference Result 50533 states and 115747 transitions. [2019-01-12 22:30:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:30:36,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-12 22:30:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:36,479 INFO L225 Difference]: With dead ends: 50533 [2019-01-12 22:30:36,479 INFO L226 Difference]: Without dead ends: 50490 [2019-01-12 22:30:36,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:30:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50490 states. [2019-01-12 22:30:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50490 to 41752. [2019-01-12 22:30:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41752 states. [2019-01-12 22:30:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41752 states to 41752 states and 96428 transitions. [2019-01-12 22:30:37,247 INFO L78 Accepts]: Start accepts. Automaton has 41752 states and 96428 transitions. Word has length 115 [2019-01-12 22:30:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:37,248 INFO L480 AbstractCegarLoop]: Abstraction has 41752 states and 96428 transitions. [2019-01-12 22:30:37,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 41752 states and 96428 transitions. [2019-01-12 22:30:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:37,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:37,289 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-12 22:30:37,289 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1774018782, now seen corresponding path program 1 times [2019-01-12 22:30:37,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:37,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:37,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:37,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 22:30:37,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:30:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:30:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:30:37,843 INFO L87 Difference]: Start difference. First operand 41752 states and 96428 transitions. Second operand 8 states. [2019-01-12 22:30:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:39,659 INFO L93 Difference]: Finished difference Result 49181 states and 112757 transitions. [2019-01-12 22:30:39,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 22:30:39,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-01-12 22:30:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:39,716 INFO L225 Difference]: With dead ends: 49181 [2019-01-12 22:30:39,716 INFO L226 Difference]: Without dead ends: 49162 [2019-01-12 22:30:39,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-12 22:30:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49162 states. [2019-01-12 22:30:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49162 to 45413. [2019-01-12 22:30:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45413 states. [2019-01-12 22:30:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45413 states to 45413 states and 104834 transitions. [2019-01-12 22:30:40,311 INFO L78 Accepts]: Start accepts. Automaton has 45413 states and 104834 transitions. Word has length 115 [2019-01-12 22:30:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:40,312 INFO L480 AbstractCegarLoop]: Abstraction has 45413 states and 104834 transitions. [2019-01-12 22:30:40,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:30:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 45413 states and 104834 transitions. [2019-01-12 22:30:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:40,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:30:40,356 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1562667869, now seen corresponding path program 1 times [2019-01-12 22:30:40,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:40,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:40,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:40,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:40,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:41,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:41,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:41,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:41,144 INFO L87 Difference]: Start difference. First operand 45413 states and 104834 transitions. Second operand 7 states. [2019-01-12 22:30:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:41,604 INFO L93 Difference]: Finished difference Result 46550 states and 107276 transitions. [2019-01-12 22:30:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:30:41,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-12 22:30:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:41,659 INFO L225 Difference]: With dead ends: 46550 [2019-01-12 22:30:41,660 INFO L226 Difference]: Without dead ends: 46550 [2019-01-12 22:30:41,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:30:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46550 states. [2019-01-12 22:30:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46550 to 45902. [2019-01-12 22:30:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45902 states. [2019-01-12 22:30:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45902 states to 45902 states and 105938 transitions. [2019-01-12 22:30:42,215 INFO L78 Accepts]: Start accepts. Automaton has 45902 states and 105938 transitions. Word has length 115 [2019-01-12 22:30:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:42,216 INFO L480 AbstractCegarLoop]: Abstraction has 45902 states and 105938 transitions. [2019-01-12 22:30:42,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 45902 states and 105938 transitions. [2019-01-12 22:30:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:42,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:42,261 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-12 22:30:42,261 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash -675164188, now seen corresponding path program 1 times [2019-01-12 22:30:42,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:42,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:42,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:42,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:42,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:42,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:42,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:42,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:42,456 INFO L87 Difference]: Start difference. First operand 45902 states and 105938 transitions. Second operand 7 states. [2019-01-12 22:30:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:42,747 INFO L93 Difference]: Finished difference Result 50748 states and 116267 transitions. [2019-01-12 22:30:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:30:42,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-12 22:30:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:42,804 INFO L225 Difference]: With dead ends: 50748 [2019-01-12 22:30:42,804 INFO L226 Difference]: Without dead ends: 50748 [2019-01-12 22:30:42,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:30:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50748 states. [2019-01-12 22:30:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50748 to 41980. [2019-01-12 22:30:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41980 states. [2019-01-12 22:30:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41980 states to 41980 states and 97037 transitions. [2019-01-12 22:30:43,719 INFO L78 Accepts]: Start accepts. Automaton has 41980 states and 97037 transitions. Word has length 115 [2019-01-12 22:30:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:43,720 INFO L480 AbstractCegarLoop]: Abstraction has 41980 states and 97037 transitions. [2019-01-12 22:30:43,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41980 states and 97037 transitions. [2019-01-12 22:30:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:43,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:43,763 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-12 22:30:43,763 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -875198974, now seen corresponding path program 1 times [2019-01-12 22:30:43,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:43,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:43,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:43,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:30:43,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:30:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:30:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:30:43,919 INFO L87 Difference]: Start difference. First operand 41980 states and 97037 transitions. Second operand 7 states. [2019-01-12 22:30:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:44,622 INFO L93 Difference]: Finished difference Result 49060 states and 111841 transitions. [2019-01-12 22:30:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:30:44,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-12 22:30:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:44,676 INFO L225 Difference]: With dead ends: 49060 [2019-01-12 22:30:44,676 INFO L226 Difference]: Without dead ends: 49034 [2019-01-12 22:30:44,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:30:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49034 states. [2019-01-12 22:30:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49034 to 43546. [2019-01-12 22:30:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43546 states. [2019-01-12 22:30:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43546 states to 43546 states and 99892 transitions. [2019-01-12 22:30:45,241 INFO L78 Accepts]: Start accepts. Automaton has 43546 states and 99892 transitions. Word has length 115 [2019-01-12 22:30:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:45,242 INFO L480 AbstractCegarLoop]: Abstraction has 43546 states and 99892 transitions. [2019-01-12 22:30:45,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:30:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 43546 states and 99892 transitions. [2019-01-12 22:30:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:45,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:45,282 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-12 22:30:45,282 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -663848061, now seen corresponding path program 1 times [2019-01-12 22:30:45,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:45,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:45,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:45,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:45,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:30:45,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:30:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:30:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:45,391 INFO L87 Difference]: Start difference. First operand 43546 states and 99892 transitions. Second operand 3 states. [2019-01-12 22:30:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:45,680 INFO L93 Difference]: Finished difference Result 53963 states and 122431 transitions. [2019-01-12 22:30:45,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:30:45,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-01-12 22:30:45,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:45,738 INFO L225 Difference]: With dead ends: 53963 [2019-01-12 22:30:45,738 INFO L226 Difference]: Without dead ends: 53963 [2019-01-12 22:30:45,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:30:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53963 states. [2019-01-12 22:30:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53963 to 53466. [2019-01-12 22:30:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53466 states. [2019-01-12 22:30:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53466 states to 53466 states and 121350 transitions. [2019-01-12 22:30:46,327 INFO L78 Accepts]: Start accepts. Automaton has 53466 states and 121350 transitions. Word has length 115 [2019-01-12 22:30:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:46,328 INFO L480 AbstractCegarLoop]: Abstraction has 53466 states and 121350 transitions. [2019-01-12 22:30:46,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:30:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 53466 states and 121350 transitions. [2019-01-12 22:30:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:46,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:46,380 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-12 22:30:46,380 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1061632836, now seen corresponding path program 1 times [2019-01-12 22:30:46,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:46,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:46,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:46,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:46,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 22:30:46,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:30:46,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:30:46,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:30:46,701 INFO L87 Difference]: Start difference. First operand 53466 states and 121350 transitions. Second operand 13 states. [2019-01-12 22:30:47,750 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-12 22:30:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:47,829 INFO L93 Difference]: Finished difference Result 87362 states and 198327 transitions. [2019-01-12 22:30:47,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:30:47,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2019-01-12 22:30:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:47,946 INFO L225 Difference]: With dead ends: 87362 [2019-01-12 22:30:47,946 INFO L226 Difference]: Without dead ends: 73563 [2019-01-12 22:30:47,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:30:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73563 states. [2019-01-12 22:30:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73563 to 60644. [2019-01-12 22:30:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60644 states. [2019-01-12 22:30:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60644 states to 60644 states and 136900 transitions. [2019-01-12 22:30:49,187 INFO L78 Accepts]: Start accepts. Automaton has 60644 states and 136900 transitions. Word has length 115 [2019-01-12 22:30:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:49,187 INFO L480 AbstractCegarLoop]: Abstraction has 60644 states and 136900 transitions. [2019-01-12 22:30:49,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:30:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60644 states and 136900 transitions. [2019-01-12 22:30:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:49,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:49,248 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-12 22:30:49,248 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2085529924, now seen corresponding path program 2 times [2019-01-12 22:30:49,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:49,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:49,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:49,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:49,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:50,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:50,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-12 22:30:50,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:30:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:30:50,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:30:50,107 INFO L87 Difference]: Start difference. First operand 60644 states and 136900 transitions. Second operand 14 states. [2019-01-12 22:30:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:51,753 INFO L93 Difference]: Finished difference Result 125980 states and 285314 transitions. [2019-01-12 22:30:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 22:30:51,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2019-01-12 22:30:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:51,880 INFO L225 Difference]: With dead ends: 125980 [2019-01-12 22:30:51,880 INFO L226 Difference]: Without dead ends: 96810 [2019-01-12 22:30:51,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 22:30:52,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96810 states. [2019-01-12 22:30:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96810 to 70023. [2019-01-12 22:30:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70023 states. [2019-01-12 22:30:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70023 states to 70023 states and 155897 transitions. [2019-01-12 22:30:52,917 INFO L78 Accepts]: Start accepts. Automaton has 70023 states and 155897 transitions. Word has length 115 [2019-01-12 22:30:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:52,918 INFO L480 AbstractCegarLoop]: Abstraction has 70023 states and 155897 transitions. [2019-01-12 22:30:52,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:30:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 70023 states and 155897 transitions. [2019-01-12 22:30:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:52,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:52,991 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-12 22:30:52,992 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1158194880, now seen corresponding path program 3 times [2019-01-12 22:30:52,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:52,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:52,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:30:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:53,327 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 22:30:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:53,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:53,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:30:53,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:30:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:30:53,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:30:53,459 INFO L87 Difference]: Start difference. First operand 70023 states and 155897 transitions. Second operand 16 states. [2019-01-12 22:30:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:54,945 INFO L93 Difference]: Finished difference Result 96196 states and 215402 transitions. [2019-01-12 22:30:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 22:30:54,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2019-01-12 22:30:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:55,058 INFO L225 Difference]: With dead ends: 96196 [2019-01-12 22:30:55,058 INFO L226 Difference]: Without dead ends: 84859 [2019-01-12 22:30:55,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1539, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 22:30:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84859 states. [2019-01-12 22:30:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84859 to 70706. [2019-01-12 22:30:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70706 states. [2019-01-12 22:30:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70706 states to 70706 states and 157513 transitions. [2019-01-12 22:30:56,628 INFO L78 Accepts]: Start accepts. Automaton has 70706 states and 157513 transitions. Word has length 115 [2019-01-12 22:30:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:56,628 INFO L480 AbstractCegarLoop]: Abstraction has 70706 states and 157513 transitions. [2019-01-12 22:30:56,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:30:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 70706 states and 157513 transitions. [2019-01-12 22:30:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:56,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:56,690 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-12 22:30:56,690 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash 861923247, now seen corresponding path program 1 times [2019-01-12 22:30:56,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:56,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:30:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:56,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:30:56,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:30:56,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:30:56,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:30:56,930 INFO L87 Difference]: Start difference. First operand 70706 states and 157513 transitions. Second operand 16 states. [2019-01-12 22:30:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:30:58,641 INFO L93 Difference]: Finished difference Result 98414 states and 220724 transitions. [2019-01-12 22:30:58,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 22:30:58,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2019-01-12 22:30:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:30:58,733 INFO L225 Difference]: With dead ends: 98414 [2019-01-12 22:30:58,733 INFO L226 Difference]: Without dead ends: 85387 [2019-01-12 22:30:58,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 22:30:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85387 states. [2019-01-12 22:30:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85387 to 67970. [2019-01-12 22:30:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67970 states. [2019-01-12 22:30:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67970 states to 67970 states and 151672 transitions. [2019-01-12 22:30:59,649 INFO L78 Accepts]: Start accepts. Automaton has 67970 states and 151672 transitions. Word has length 115 [2019-01-12 22:30:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:30:59,649 INFO L480 AbstractCegarLoop]: Abstraction has 67970 states and 151672 transitions. [2019-01-12 22:30:59,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:30:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 67970 states and 151672 transitions. [2019-01-12 22:30:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:30:59,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:30:59,722 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-12 22:30:59,722 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:30:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:30:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash -312631492, now seen corresponding path program 1 times [2019-01-12 22:30:59,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:30:59,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:30:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:59,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:30:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:30:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:30:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:30:59,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:30:59,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:30:59,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:30:59,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:30:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:30:59,961 INFO L87 Difference]: Start difference. First operand 67970 states and 151672 transitions. Second operand 10 states. [2019-01-12 22:31:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:31:00,850 INFO L93 Difference]: Finished difference Result 77149 states and 172035 transitions. [2019-01-12 22:31:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:31:00,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-01-12 22:31:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:31:00,861 INFO L225 Difference]: With dead ends: 77149 [2019-01-12 22:31:00,861 INFO L226 Difference]: Without dead ends: 7850 [2019-01-12 22:31:00,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:31:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2019-01-12 22:31:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 7850. [2019-01-12 22:31:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7850 states. [2019-01-12 22:31:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7850 states to 7850 states and 18314 transitions. [2019-01-12 22:31:00,941 INFO L78 Accepts]: Start accepts. Automaton has 7850 states and 18314 transitions. Word has length 115 [2019-01-12 22:31:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:31:00,941 INFO L480 AbstractCegarLoop]: Abstraction has 7850 states and 18314 transitions. [2019-01-12 22:31:00,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:31:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 7850 states and 18314 transitions. [2019-01-12 22:31:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:31:00,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:31:00,949 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-12 22:31:00,949 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:31:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:31:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1293718377, now seen corresponding path program 2 times [2019-01-12 22:31:00,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:31:00,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:31:00,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:00,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:31:00,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:31:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:31:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:31:01,049 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:31:01,273 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:31:01,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:31:01 BasicIcfg [2019-01-12 22:31:01,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:31:01,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:31:01,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:31:01,278 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:31:01,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:02" (3/4) ... [2019-01-12 22:31:01,284 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:31:01,495 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:31:01,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:31:01,496 INFO L168 Benchmark]: Toolchain (without parser) took 181303.78 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 951.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2019-01-12 22:31:01,498 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:31:01,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:01,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:01,499 INFO L168 Benchmark]: Boogie Preprocessor took 50.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:31:01,500 INFO L168 Benchmark]: RCFGBuilder took 1477.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:01,504 INFO L168 Benchmark]: TraceAbstraction took 178672.54 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2019-01-12 22:31:01,505 INFO L168 Benchmark]: Witness Printer took 217.99 ms. Allocated memory is still 7.3 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-01-12 22:31:01,507 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.16 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 801.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.26 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 1477.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 178672.54 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 217.99 ms. Allocated memory is still 7.3 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 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] [L686] -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, y=0] [L687] -1 _Bool y$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, y=0, y$flush_delayed=0] [L688] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 pthread_t t8; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK -1 pthread_create(&t8, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 pthread_t t9; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK -1 pthread_create(&t9, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$w_buff1 = y$w_buff0 [L707] 0 y$w_buff0 = 1 [L708] 0 y$w_buff1_used = y$w_buff0_used [L709] 0 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L712] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L713] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L714] 0 y$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 y$flush_delayed = weak$$choice2 [L720] 0 y$mem_tmp = y 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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = 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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 0 y$flush_delayed ? y$mem_tmp : 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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 y = y$flush_delayed ? y$mem_tmp : y [L730] 0 y$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = 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=3, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 x = 1 [L753] 1 __unbuffered_p1_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y 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=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$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=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$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=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$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=3, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=3, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$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=3, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=3, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$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=3, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = y 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=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y 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=3, x=1, y=0, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y 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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [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=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 178.4s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 55.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17387 SDtfs, 23252 SDslu, 64319 SDs, 0 SdLazy, 15239 SolverSat, 1041 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 109 SyntacticMatches, 36 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 14.5s 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: 96.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 777253 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 3667 NumberOfCodeBlocks, 3667 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3514 ConstructedInterpolants, 0 QuantifiedInterpolants, 1034608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...