./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix041_power.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 424d85e81579c93fea3149876316172742bff15d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 21:11:35,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 21:11:35,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 21:11:35,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 21:11:35,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 21:11:35,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 21:11:35,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 21:11:35,130 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 21:11:35,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 21:11:35,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 21:11:35,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 21:11:35,137 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 21:11:35,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 21:11:35,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 21:11:35,141 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 21:11:35,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 21:11:35,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 21:11:35,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 21:11:35,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 21:11:35,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 21:11:35,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 21:11:35,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 21:11:35,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 21:11:35,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 21:11:35,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 21:11:35,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 21:11:35,172 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 21:11:35,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 21:11:35,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 21:11:35,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 21:11:35,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 21:11:35,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 21:11:35,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 21:11:35,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 21:11:35,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 21:11:35,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 21:11:35,187 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 21:11:35,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 21:11:35,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 21:11:35,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 21:11:35,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 21:11:35,225 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 21:11:35,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 21:11:35,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 21:11:35,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 21:11:35,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 21:11:35,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 21:11:35,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 21:11:35,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 21:11:35,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 21:11:35,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 21:11:35,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 21:11:35,228 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 21:11:35,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 21:11:35,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 21:11:35,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 21:11:35,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 21:11:35,231 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 21:11:35,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:11:35,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 21:11:35,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 21:11:35,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 21:11:35,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 21:11:35,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 21:11:35,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 21:11:35,234 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 -> 424d85e81579c93fea3149876316172742bff15d [2018-12-31 21:11:35,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 21:11:35,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 21:11:35,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 21:11:35,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 21:11:35,306 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 21:11:35,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-12-31 21:11:35,381 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0ed02343/606863f135a5401ab341e92aa7045c76/FLAG2fcdce717 [2018-12-31 21:11:35,984 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 21:11:35,985 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-12-31 21:11:36,013 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0ed02343/606863f135a5401ab341e92aa7045c76/FLAG2fcdce717 [2018-12-31 21:11:36,234 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0ed02343/606863f135a5401ab341e92aa7045c76 [2018-12-31 21:11:36,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 21:11:36,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 21:11:36,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 21:11:36,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 21:11:36,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 21:11:36,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:11:36" (1/1) ... [2018-12-31 21:11:36,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e4e796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:36, skipping insertion in model container [2018-12-31 21:11:36,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:11:36" (1/1) ... [2018-12-31 21:11:36,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 21:11:36,336 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 21:11:36,904 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:11:36,930 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 21:11:37,097 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:11:37,197 INFO L195 MainTranslator]: Completed translation [2018-12-31 21:11:37,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37 WrapperNode [2018-12-31 21:11:37,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 21:11:37,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 21:11:37,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 21:11:37,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 21:11:37,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 21:11:37,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 21:11:37,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 21:11:37,273 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 21:11:37,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... [2018-12-31 21:11:37,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 21:11:37,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 21:11:37,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 21:11:37,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 21:11:37,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:11:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 21:11:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 21:11:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 21:11:37,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 21:11:37,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 21:11:37,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 21:11:37,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 21:11:37,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 21:11:37,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 21:11:37,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 21:11:37,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 21:11:37,391 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 21:11:38,637 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 21:11:38,638 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 21:11:38,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:11:38 BoogieIcfgContainer [2018-12-31 21:11:38,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 21:11:38,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 21:11:38,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 21:11:38,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 21:11:38,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:11:36" (1/3) ... [2018-12-31 21:11:38,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0cf2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:11:38, skipping insertion in model container [2018-12-31 21:11:38,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:11:37" (2/3) ... [2018-12-31 21:11:38,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0cf2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:11:38, skipping insertion in model container [2018-12-31 21:11:38,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:11:38" (3/3) ... [2018-12-31 21:11:38,648 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_false-unreach-call.i [2018-12-31 21:11:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,703 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,703 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,703 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,704 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,704 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,724 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,725 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,749 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,750 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,750 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,750 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,750 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,751 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,752 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,753 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,754 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,755 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:11:38,796 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 21:11:38,796 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 21:11:38,807 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 21:11:38,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 21:11:38,849 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 21:11:38,850 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 21:11:38,850 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 21:11:38,850 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 21:11:38,850 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 21:11:38,850 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 21:11:38,851 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 21:11:38,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 21:11:38,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 21:11:38,864 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 21:11:41,414 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-31 21:11:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-31 21:11:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 21:11:41,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:11:41,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:11:41,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:11:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:11:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-31 21:11:41,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:11:41,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:11:41,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:41,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:11:41,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:11:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:11:41,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:11:41,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:11:41,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:11:41,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:11:41,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:11:41,880 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-31 21:11:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:11:43,615 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-31 21:11:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:11:43,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-31 21:11:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:11:44,007 INFO L225 Difference]: With dead ends: 60791 [2018-12-31 21:11:44,008 INFO L226 Difference]: Without dead ends: 44271 [2018-12-31 21:11:44,010 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 [2018-12-31 21:11:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-31 21:11:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-31 21:11:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-31 21:11:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-31 21:11:46,093 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-31 21:11:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:11:46,094 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-31 21:11:46,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:11:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-31 21:11:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 21:11:46,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:11:46,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:11:46,107 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:11:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:11:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-31 21:11:46,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:11:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:11:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:46,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:11:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:11:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:11:46,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:11:46,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:11:46,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:11:46,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:11:46,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:11:46,251 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-12-31 21:11:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:11:46,930 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-12-31 21:11:46,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:11:46,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-31 21:11:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:11:47,119 INFO L225 Difference]: With dead ends: 27339 [2018-12-31 21:11:47,119 INFO L226 Difference]: Without dead ends: 27339 [2018-12-31 21:11:47,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:11:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-31 21:11:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-12-31 21:11:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-31 21:11:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-12-31 21:11:48,525 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-12-31 21:11:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:11:48,526 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-12-31 21:11:48,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:11:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-12-31 21:11:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 21:11:48,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:11:48,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:11:48,534 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:11:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:11:48,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2042016398, now seen corresponding path program 1 times [2018-12-31 21:11:48,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:11:48,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:11:48,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:11:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:11:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:11:48,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:11:48,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:11:48,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:11:48,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:11:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:11:48,829 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 5 states. [2018-12-31 21:11:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:11:50,534 INFO L93 Difference]: Finished difference Result 64005 states and 235022 transitions. [2018-12-31 21:11:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:11:50,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 21:11:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:11:50,809 INFO L225 Difference]: With dead ends: 64005 [2018-12-31 21:11:50,810 INFO L226 Difference]: Without dead ends: 63453 [2018-12-31 21:11:50,810 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 [2018-12-31 21:11:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-31 21:11:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-31 21:11:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-31 21:11:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152053 transitions. [2018-12-31 21:11:53,148 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152053 transitions. Word has length 46 [2018-12-31 21:11:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:11:53,149 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152053 transitions. [2018-12-31 21:11:53,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:11:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152053 transitions. [2018-12-31 21:11:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 21:11:53,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:11:53,156 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] [2018-12-31 21:11:53,157 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:11:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:11:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-31 21:11:53,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:11:53,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:11:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:11:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:11:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:11:53,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:11:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:11:53,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:11:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:11:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:11:53,336 INFO L87 Difference]: Start difference. First operand 41421 states and 152053 transitions. Second operand 6 states. [2018-12-31 21:11:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:11:54,518 INFO L93 Difference]: Finished difference Result 52771 states and 190649 transitions. [2018-12-31 21:11:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:11:54,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-31 21:11:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:11:54,666 INFO L225 Difference]: With dead ends: 52771 [2018-12-31 21:11:54,666 INFO L226 Difference]: Without dead ends: 52259 [2018-12-31 21:11:54,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:11:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52259 states. [2018-12-31 21:11:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52259 to 45375. [2018-12-31 21:11:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-31 21:11:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 165678 transitions. [2018-12-31 21:11:56,768 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 165678 transitions. Word has length 47 [2018-12-31 21:11:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:11:56,769 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 165678 transitions. [2018-12-31 21:11:56,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:11:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 165678 transitions. [2018-12-31 21:11:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 21:11:56,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:11:56,781 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] [2018-12-31 21:11:56,781 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:11:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:11:56,782 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-31 21:11:56,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:11:56,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:11:56,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:56,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:11:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:11:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:11:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:11:56,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:11:56,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:11:56,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:11:56,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:11:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:11:56,870 INFO L87 Difference]: Start difference. First operand 45375 states and 165678 transitions. Second operand 3 states. [2018-12-31 21:11:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:11:57,293 INFO L93 Difference]: Finished difference Result 65251 states and 235338 transitions. [2018-12-31 21:11:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:11:57,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 21:11:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:11:57,463 INFO L225 Difference]: With dead ends: 65251 [2018-12-31 21:11:57,464 INFO L226 Difference]: Without dead ends: 65251 [2018-12-31 21:11:57,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:11:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-31 21:12:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-31 21:12:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-31 21:12:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 183963 transitions. [2018-12-31 21:12:02,266 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 183963 transitions. Word has length 49 [2018-12-31 21:12:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:02,266 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 183963 transitions. [2018-12-31 21:12:02,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:12:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 183963 transitions. [2018-12-31 21:12:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:12:02,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:02,283 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] [2018-12-31 21:12:02,284 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:02,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:02,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139769, now seen corresponding path program 1 times [2018-12-31 21:12:02,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:02,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:02,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:02,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:02,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:02,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:02,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:02,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:02,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:02,485 INFO L87 Difference]: Start difference. First operand 50945 states and 183963 transitions. Second operand 6 states. [2018-12-31 21:12:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:03,748 INFO L93 Difference]: Finished difference Result 67511 states and 241920 transitions. [2018-12-31 21:12:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:03,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 21:12:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:03,925 INFO L225 Difference]: With dead ends: 67511 [2018-12-31 21:12:03,926 INFO L226 Difference]: Without dead ends: 67511 [2018-12-31 21:12:03,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-31 21:12:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-31 21:12:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-31 21:12:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227319 transitions. [2018-12-31 21:12:06,173 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227319 transitions. Word has length 53 [2018-12-31 21:12:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:06,173 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227319 transitions. [2018-12-31 21:12:06,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227319 transitions. [2018-12-31 21:12:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:12:06,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:06,188 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] [2018-12-31 21:12:06,188 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash 905876168, now seen corresponding path program 1 times [2018-12-31 21:12:06,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:06,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:06,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:06,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:06,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:12:06,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:12:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:12:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:06,478 INFO L87 Difference]: Start difference. First operand 63436 states and 227319 transitions. Second operand 7 states. [2018-12-31 21:12:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:08,120 INFO L93 Difference]: Finished difference Result 88528 states and 305936 transitions. [2018-12-31 21:12:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 21:12:08,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-31 21:12:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:08,357 INFO L225 Difference]: With dead ends: 88528 [2018-12-31 21:12:08,357 INFO L226 Difference]: Without dead ends: 88528 [2018-12-31 21:12:08,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:12:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-31 21:12:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-31 21:12:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-31 21:12:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262722 transitions. [2018-12-31 21:12:09,954 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262722 transitions. Word has length 53 [2018-12-31 21:12:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:09,955 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262722 transitions. [2018-12-31 21:12:09,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:12:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262722 transitions. [2018-12-31 21:12:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:12:09,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:09,972 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] [2018-12-31 21:12:09,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1793379849, now seen corresponding path program 1 times [2018-12-31 21:12:09,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:09,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:10,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:10,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:10,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:10,149 INFO L87 Difference]: Start difference. First operand 74881 states and 262722 transitions. Second operand 4 states. [2018-12-31 21:12:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:10,457 INFO L93 Difference]: Finished difference Result 15375 states and 48802 transitions. [2018-12-31 21:12:10,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:12:10,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 21:12:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:10,485 INFO L225 Difference]: With dead ends: 15375 [2018-12-31 21:12:10,485 INFO L226 Difference]: Without dead ends: 13789 [2018-12-31 21:12:10,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-31 21:12:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-31 21:12:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-31 21:12:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43328 transitions. [2018-12-31 21:12:10,690 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43328 transitions. Word has length 53 [2018-12-31 21:12:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:10,690 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43328 transitions. [2018-12-31 21:12:10,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43328 transitions. [2018-12-31 21:12:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:12:10,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:10,692 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] [2018-12-31 21:12:10,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-31 21:12:10,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:10,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:10,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:10,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:10,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:10,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:10,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:10,867 INFO L87 Difference]: Start difference. First operand 13740 states and 43328 transitions. Second operand 6 states. [2018-12-31 21:12:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:11,815 INFO L93 Difference]: Finished difference Result 19970 states and 62557 transitions. [2018-12-31 21:12:11,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 21:12:11,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 21:12:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:11,863 INFO L225 Difference]: With dead ends: 19970 [2018-12-31 21:12:11,864 INFO L226 Difference]: Without dead ends: 19898 [2018-12-31 21:12:11,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 21:12:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-31 21:12:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-31 21:12:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-31 21:12:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45025 transitions. [2018-12-31 21:12:12,114 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45025 transitions. Word has length 53 [2018-12-31 21:12:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:12,114 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45025 transitions. [2018-12-31 21:12:12,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45025 transitions. [2018-12-31 21:12:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 21:12:12,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:12,121 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] [2018-12-31 21:12:12,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-31 21:12:12,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:12,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:12,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:12,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:12,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:12,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:12,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:12,344 INFO L87 Difference]: Start difference. First operand 14314 states and 45025 transitions. Second operand 4 states. [2018-12-31 21:12:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:12,596 INFO L93 Difference]: Finished difference Result 16617 states and 52353 transitions. [2018-12-31 21:12:12,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:12:12,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-31 21:12:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:12,630 INFO L225 Difference]: With dead ends: 16617 [2018-12-31 21:12:12,630 INFO L226 Difference]: Without dead ends: 16617 [2018-12-31 21:12:12,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-31 21:12:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-31 21:12:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-31 21:12:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47615 transitions. [2018-12-31 21:12:12,870 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47615 transitions. Word has length 61 [2018-12-31 21:12:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:12,871 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47615 transitions. [2018-12-31 21:12:12,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47615 transitions. [2018-12-31 21:12:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 21:12:12,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:12,876 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] [2018-12-31 21:12:12,876 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-31 21:12:12,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:12,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:12,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:12,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:13,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:13,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:13,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:13,082 INFO L87 Difference]: Start difference. First operand 15134 states and 47615 transitions. Second operand 6 states. [2018-12-31 21:12:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:13,732 INFO L93 Difference]: Finished difference Result 28106 states and 88091 transitions. [2018-12-31 21:12:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 21:12:13,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 21:12:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:13,785 INFO L225 Difference]: With dead ends: 28106 [2018-12-31 21:12:13,785 INFO L226 Difference]: Without dead ends: 28035 [2018-12-31 21:12:13,786 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 [2018-12-31 21:12:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-31 21:12:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-31 21:12:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-31 21:12:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54277 transitions. [2018-12-31 21:12:14,114 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54277 transitions. Word has length 61 [2018-12-31 21:12:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:14,115 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54277 transitions. [2018-12-31 21:12:14,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54277 transitions. [2018-12-31 21:12:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 21:12:14,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:14,122 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] [2018-12-31 21:12:14,123 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash 962407834, now seen corresponding path program 1 times [2018-12-31 21:12:14,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:14,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:14,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:14,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:12:14,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:12:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:12:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:14,195 INFO L87 Difference]: Start difference. First operand 17412 states and 54277 transitions. Second operand 3 states. [2018-12-31 21:12:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:14,490 INFO L93 Difference]: Finished difference Result 18092 states and 56109 transitions. [2018-12-31 21:12:14,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:12:14,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 21:12:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:14,525 INFO L225 Difference]: With dead ends: 18092 [2018-12-31 21:12:14,525 INFO L226 Difference]: Without dead ends: 18092 [2018-12-31 21:12:14,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-31 21:12:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-31 21:12:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-31 21:12:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55193 transitions. [2018-12-31 21:12:14,788 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55193 transitions. Word has length 65 [2018-12-31 21:12:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:14,788 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55193 transitions. [2018-12-31 21:12:14,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:12:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55193 transitions. [2018-12-31 21:12:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 21:12:14,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:14,796 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] [2018-12-31 21:12:14,796 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash -901897063, now seen corresponding path program 1 times [2018-12-31 21:12:14,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:14,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:14,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:15,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:15,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:15,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:15,033 INFO L87 Difference]: Start difference. First operand 17752 states and 55193 transitions. Second operand 4 states. [2018-12-31 21:12:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:15,509 INFO L93 Difference]: Finished difference Result 21696 states and 66682 transitions. [2018-12-31 21:12:15,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:15,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-31 21:12:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:15,551 INFO L225 Difference]: With dead ends: 21696 [2018-12-31 21:12:15,551 INFO L226 Difference]: Without dead ends: 21696 [2018-12-31 21:12:15,552 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 [2018-12-31 21:12:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-31 21:12:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-31 21:12:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-31 21:12:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60572 transitions. [2018-12-31 21:12:15,853 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60572 transitions. Word has length 65 [2018-12-31 21:12:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:15,853 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60572 transitions. [2018-12-31 21:12:15,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60572 transitions. [2018-12-31 21:12:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:12:15,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:15,865 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] [2018-12-31 21:12:15,865 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:15,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:15,865 INFO L82 PathProgramCache]: Analyzing trace with hash -987757598, now seen corresponding path program 1 times [2018-12-31 21:12:15,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:15,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:15,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:15,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:15,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:16,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:16,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:16,415 INFO L87 Difference]: Start difference. First operand 19646 states and 60572 transitions. Second operand 6 states. [2018-12-31 21:12:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:17,641 INFO L93 Difference]: Finished difference Result 23814 states and 72270 transitions. [2018-12-31 21:12:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:12:17,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 21:12:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:17,706 INFO L225 Difference]: With dead ends: 23814 [2018-12-31 21:12:17,707 INFO L226 Difference]: Without dead ends: 23814 [2018-12-31 21:12:17,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-31 21:12:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-31 21:12:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-31 21:12:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68700 transitions. [2018-12-31 21:12:18,053 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68700 transitions. Word has length 67 [2018-12-31 21:12:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:18,054 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68700 transitions. [2018-12-31 21:12:18,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68700 transitions. [2018-12-31 21:12:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:12:18,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:18,067 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] [2018-12-31 21:12:18,067 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1230000355, now seen corresponding path program 1 times [2018-12-31 21:12:18,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:18,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:18,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:18,391 INFO L87 Difference]: Start difference. First operand 22474 states and 68700 transitions. Second operand 6 states. [2018-12-31 21:12:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:19,142 INFO L93 Difference]: Finished difference Result 25702 states and 76160 transitions. [2018-12-31 21:12:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:12:19,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 21:12:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:19,190 INFO L225 Difference]: With dead ends: 25702 [2018-12-31 21:12:19,190 INFO L226 Difference]: Without dead ends: 25702 [2018-12-31 21:12:19,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:12:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-31 21:12:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-31 21:12:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-31 21:12:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68806 transitions. [2018-12-31 21:12:19,562 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68806 transitions. Word has length 67 [2018-12-31 21:12:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:19,562 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68806 transitions. [2018-12-31 21:12:19,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68806 transitions. [2018-12-31 21:12:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:12:19,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:19,575 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] [2018-12-31 21:12:19,576 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1441351268, now seen corresponding path program 1 times [2018-12-31 21:12:19,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:19,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:19,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:19,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:19,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:19,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:19,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:19,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:19,756 INFO L87 Difference]: Start difference. First operand 22858 states and 68806 transitions. Second operand 5 states. [2018-12-31 21:12:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:20,249 INFO L93 Difference]: Finished difference Result 29793 states and 89371 transitions. [2018-12-31 21:12:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:12:20,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 21:12:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:20,306 INFO L225 Difference]: With dead ends: 29793 [2018-12-31 21:12:20,306 INFO L226 Difference]: Without dead ends: 29793 [2018-12-31 21:12:20,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-31 21:12:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-31 21:12:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-31 21:12:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80315 transitions. [2018-12-31 21:12:20,767 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80315 transitions. Word has length 67 [2018-12-31 21:12:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:20,768 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80315 transitions. [2018-12-31 21:12:20,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80315 transitions. [2018-12-31 21:12:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:12:20,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:20,783 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] [2018-12-31 21:12:20,783 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:20,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash 930817091, now seen corresponding path program 1 times [2018-12-31 21:12:20,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:20,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:20,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:20,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:20,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:20,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:20,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:20,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:20,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:20,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:20,884 INFO L87 Difference]: Start difference. First operand 26814 states and 80315 transitions. Second operand 5 states. [2018-12-31 21:12:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:21,531 INFO L93 Difference]: Finished difference Result 36420 states and 108385 transitions. [2018-12-31 21:12:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:21,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 21:12:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:21,614 INFO L225 Difference]: With dead ends: 36420 [2018-12-31 21:12:21,614 INFO L226 Difference]: Without dead ends: 36420 [2018-12-31 21:12:21,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-31 21:12:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-31 21:12:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-31 21:12:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87791 transitions. [2018-12-31 21:12:22,179 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87791 transitions. Word has length 67 [2018-12-31 21:12:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:22,180 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87791 transitions. [2018-12-31 21:12:22,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87791 transitions. [2018-12-31 21:12:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:12:22,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:22,193 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] [2018-12-31 21:12:22,193 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash -876637372, now seen corresponding path program 1 times [2018-12-31 21:12:22,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:22,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:22,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:22,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:22,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:22,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:22,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:22,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:22,296 INFO L87 Difference]: Start difference. First operand 29428 states and 87791 transitions. Second operand 4 states. [2018-12-31 21:12:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:23,196 INFO L93 Difference]: Finished difference Result 38892 states and 116477 transitions. [2018-12-31 21:12:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:12:23,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 21:12:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:23,295 INFO L225 Difference]: With dead ends: 38892 [2018-12-31 21:12:23,295 INFO L226 Difference]: Without dead ends: 38660 [2018-12-31 21:12:23,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38660 states. [2018-12-31 21:12:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38660 to 35784. [2018-12-31 21:12:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2018-12-31 21:12:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 107258 transitions. [2018-12-31 21:12:24,090 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 107258 transitions. Word has length 67 [2018-12-31 21:12:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:24,091 INFO L480 AbstractCegarLoop]: Abstraction has 35784 states and 107258 transitions. [2018-12-31 21:12:24,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 107258 transitions. [2018-12-31 21:12:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:12:24,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:24,109 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] [2018-12-31 21:12:24,109 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1621378565, now seen corresponding path program 1 times [2018-12-31 21:12:24,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:24,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:24,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:24,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:24,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:24,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:24,347 INFO L87 Difference]: Start difference. First operand 35784 states and 107258 transitions. Second operand 5 states. [2018-12-31 21:12:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:24,569 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-31 21:12:24,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:12:24,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 21:12:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:24,581 INFO L225 Difference]: With dead ends: 9316 [2018-12-31 21:12:24,581 INFO L226 Difference]: Without dead ends: 7464 [2018-12-31 21:12:24,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-31 21:12:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-31 21:12:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-31 21:12:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-31 21:12:24,669 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-31 21:12:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:24,669 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-31 21:12:24,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-31 21:12:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:12:24,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:24,675 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] [2018-12-31 21:12:24,676 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-31 21:12:24,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:24,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:24,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:12:24,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:12:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:12:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:24,730 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-31 21:12:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:24,798 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-31 21:12:24,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:12:24,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 21:12:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:24,811 INFO L225 Difference]: With dead ends: 8820 [2018-12-31 21:12:24,812 INFO L226 Difference]: Without dead ends: 8820 [2018-12-31 21:12:24,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-31 21:12:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-31 21:12:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-31 21:12:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-31 21:12:24,900 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-31 21:12:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:24,900 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-31 21:12:24,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:12:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-31 21:12:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 21:12:24,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:24,907 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] [2018-12-31 21:12:24,907 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-31 21:12:24,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:24,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:24,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:24,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:25,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:25,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:25,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:25,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:25,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:25,058 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-31 21:12:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:25,294 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-31 21:12:25,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:12:25,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-31 21:12:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:25,306 INFO L225 Difference]: With dead ends: 7470 [2018-12-31 21:12:25,306 INFO L226 Difference]: Without dead ends: 7470 [2018-12-31 21:12:25,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:12:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-31 21:12:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-31 21:12:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-31 21:12:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-31 21:12:25,383 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-31 21:12:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:25,383 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-31 21:12:25,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-31 21:12:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 21:12:25,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:25,390 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] [2018-12-31 21:12:25,390 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:25,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:25,390 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-31 21:12:25,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:25,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:25,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:25,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:25,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:25,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:25,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:12:25,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:12:25,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:12:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:25,647 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-31 21:12:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:26,184 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-31 21:12:26,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 21:12:26,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-31 21:12:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:26,197 INFO L225 Difference]: With dead ends: 7881 [2018-12-31 21:12:26,197 INFO L226 Difference]: Without dead ends: 7762 [2018-12-31 21:12:26,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 21:12:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-31 21:12:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-31 21:12:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-31 21:12:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-31 21:12:26,323 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-31 21:12:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:26,323 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-31 21:12:26,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:12:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-31 21:12:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:12:26,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:26,333 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] [2018-12-31 21:12:26,333 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash 278460757, now seen corresponding path program 1 times [2018-12-31 21:12:26,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:26,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:26,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:26,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:26,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:26,465 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-31 21:12:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:26,956 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-31 21:12:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:26,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 21:12:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:26,974 INFO L225 Difference]: With dead ends: 10608 [2018-12-31 21:12:26,974 INFO L226 Difference]: Without dead ends: 10608 [2018-12-31 21:12:26,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-31 21:12:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-31 21:12:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-31 21:12:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-31 21:12:27,113 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-31 21:12:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:27,113 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-31 21:12:27,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-31 21:12:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:12:27,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:27,125 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] [2018-12-31 21:12:27,125 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1501880951, now seen corresponding path program 2 times [2018-12-31 21:12:27,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:27,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:27,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:27,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:27,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:27,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:27,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:27,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:27,247 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-31 21:12:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:27,386 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-31 21:12:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:27,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 21:12:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:27,399 INFO L225 Difference]: With dead ends: 8526 [2018-12-31 21:12:27,399 INFO L226 Difference]: Without dead ends: 8526 [2018-12-31 21:12:27,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-31 21:12:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-31 21:12:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-31 21:12:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-31 21:12:27,514 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-31 21:12:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:27,514 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-31 21:12:27,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-31 21:12:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:27,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:27,528 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] [2018-12-31 21:12:27,528 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash -183159973, now seen corresponding path program 1 times [2018-12-31 21:12:27,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:27,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:27,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:27,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:12:27,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:27,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:27,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:12:27,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:12:27,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:12:27,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:27,689 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 7 states. [2018-12-31 21:12:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:28,582 INFO L93 Difference]: Finished difference Result 9705 states and 21992 transitions. [2018-12-31 21:12:28,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:12:28,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 21:12:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:28,597 INFO L225 Difference]: With dead ends: 9705 [2018-12-31 21:12:28,597 INFO L226 Difference]: Without dead ends: 9705 [2018-12-31 21:12:28,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2018-12-31 21:12:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 7979. [2018-12-31 21:12:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2018-12-31 21:12:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 18204 transitions. [2018-12-31 21:12:28,705 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 18204 transitions. Word has length 94 [2018-12-31 21:12:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:28,706 INFO L480 AbstractCegarLoop]: Abstraction has 7979 states and 18204 transitions. [2018-12-31 21:12:28,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:12:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 18204 transitions. [2018-12-31 21:12:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:28,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:28,716 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] [2018-12-31 21:12:28,716 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:28,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1017402368, now seen corresponding path program 1 times [2018-12-31 21:12:28,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:28,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:28,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:28,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:28,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:28,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:28,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:28,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:28,903 INFO L87 Difference]: Start difference. First operand 7979 states and 18204 transitions. Second operand 5 states. [2018-12-31 21:12:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:29,030 INFO L93 Difference]: Finished difference Result 8886 states and 20162 transitions. [2018-12-31 21:12:29,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:12:29,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 21:12:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:29,042 INFO L225 Difference]: With dead ends: 8886 [2018-12-31 21:12:29,042 INFO L226 Difference]: Without dead ends: 8886 [2018-12-31 21:12:29,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2018-12-31 21:12:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 6875. [2018-12-31 21:12:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-12-31 21:12:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 15723 transitions. [2018-12-31 21:12:29,135 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 15723 transitions. Word has length 94 [2018-12-31 21:12:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:29,135 INFO L480 AbstractCegarLoop]: Abstraction has 6875 states and 15723 transitions. [2018-12-31 21:12:29,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 15723 transitions. [2018-12-31 21:12:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:29,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:29,144 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] [2018-12-31 21:12:29,144 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:29,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1272138913, now seen corresponding path program 1 times [2018-12-31 21:12:29,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:29,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:29,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:29,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:29,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:29,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:29,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:29,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:29,327 INFO L87 Difference]: Start difference. First operand 6875 states and 15723 transitions. Second operand 5 states. [2018-12-31 21:12:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:29,875 INFO L93 Difference]: Finished difference Result 11409 states and 26292 transitions. [2018-12-31 21:12:29,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:12:29,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 21:12:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:29,891 INFO L225 Difference]: With dead ends: 11409 [2018-12-31 21:12:29,891 INFO L226 Difference]: Without dead ends: 11331 [2018-12-31 21:12:29,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:12:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11331 states. [2018-12-31 21:12:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11331 to 8016. [2018-12-31 21:12:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8016 states. [2018-12-31 21:12:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 18370 transitions. [2018-12-31 21:12:30,011 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 18370 transitions. Word has length 94 [2018-12-31 21:12:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:30,011 INFO L480 AbstractCegarLoop]: Abstraction has 8016 states and 18370 transitions. [2018-12-31 21:12:30,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 18370 transitions. [2018-12-31 21:12:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:30,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:30,021 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] [2018-12-31 21:12:30,022 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -27374432, now seen corresponding path program 1 times [2018-12-31 21:12:30,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:30,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:30,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:30,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:30,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:30,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:30,134 INFO L87 Difference]: Start difference. First operand 8016 states and 18370 transitions. Second operand 6 states. [2018-12-31 21:12:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:30,529 INFO L93 Difference]: Finished difference Result 10151 states and 23092 transitions. [2018-12-31 21:12:30,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:12:30,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 21:12:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:30,543 INFO L225 Difference]: With dead ends: 10151 [2018-12-31 21:12:30,543 INFO L226 Difference]: Without dead ends: 10072 [2018-12-31 21:12:30,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:12:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10072 states. [2018-12-31 21:12:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10072 to 7615. [2018-12-31 21:12:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7615 states. [2018-12-31 21:12:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7615 states to 7615 states and 17480 transitions. [2018-12-31 21:12:30,650 INFO L78 Accepts]: Start accepts. Automaton has 7615 states and 17480 transitions. Word has length 94 [2018-12-31 21:12:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:30,651 INFO L480 AbstractCegarLoop]: Abstraction has 7615 states and 17480 transitions. [2018-12-31 21:12:30,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7615 states and 17480 transitions. [2018-12-31 21:12:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:30,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:30,659 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] [2018-12-31 21:12:30,659 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1265351353, now seen corresponding path program 1 times [2018-12-31 21:12:30,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:30,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:30,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:30,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:30,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:30,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:30,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:12:30,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:12:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:12:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:12:30,966 INFO L87 Difference]: Start difference. First operand 7615 states and 17480 transitions. Second operand 9 states. [2018-12-31 21:12:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:31,655 INFO L93 Difference]: Finished difference Result 10663 states and 24406 transitions. [2018-12-31 21:12:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 21:12:31,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-31 21:12:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:31,671 INFO L225 Difference]: With dead ends: 10663 [2018-12-31 21:12:31,671 INFO L226 Difference]: Without dead ends: 10631 [2018-12-31 21:12:31,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-31 21:12:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10631 states. [2018-12-31 21:12:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10631 to 9164. [2018-12-31 21:12:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-12-31 21:12:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 20930 transitions. [2018-12-31 21:12:31,791 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 20930 transitions. Word has length 94 [2018-12-31 21:12:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:31,791 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 20930 transitions. [2018-12-31 21:12:31,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:12:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 20930 transitions. [2018-12-31 21:12:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:31,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:31,803 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] [2018-12-31 21:12:31,803 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1232664584, now seen corresponding path program 1 times [2018-12-31 21:12:31,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:31,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:31,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:32,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:32,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:12:32,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:12:32,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:12:32,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:32,116 INFO L87 Difference]: Start difference. First operand 9164 states and 20930 transitions. Second operand 8 states. [2018-12-31 21:12:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:32,619 INFO L93 Difference]: Finished difference Result 14220 states and 32894 transitions. [2018-12-31 21:12:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 21:12:32,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-31 21:12:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:32,641 INFO L225 Difference]: With dead ends: 14220 [2018-12-31 21:12:32,641 INFO L226 Difference]: Without dead ends: 14220 [2018-12-31 21:12:32,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 21:12:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14220 states. [2018-12-31 21:12:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14220 to 9754. [2018-12-31 21:12:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9754 states. [2018-12-31 21:12:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9754 states to 9754 states and 22461 transitions. [2018-12-31 21:12:32,791 INFO L78 Accepts]: Start accepts. Automaton has 9754 states and 22461 transitions. Word has length 94 [2018-12-31 21:12:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:32,791 INFO L480 AbstractCegarLoop]: Abstraction has 9754 states and 22461 transitions. [2018-12-31 21:12:32,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:12:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 9754 states and 22461 transitions. [2018-12-31 21:12:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:12:32,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:32,802 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] [2018-12-31 21:12:32,803 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:32,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:32,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2120168265, now seen corresponding path program 1 times [2018-12-31 21:12:32,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:32,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:32,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:32,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:12:32,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:12:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:12:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:32,917 INFO L87 Difference]: Start difference. First operand 9754 states and 22461 transitions. Second operand 3 states. [2018-12-31 21:12:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:32,958 INFO L93 Difference]: Finished difference Result 9498 states and 21661 transitions. [2018-12-31 21:12:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:12:32,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-31 21:12:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:32,972 INFO L225 Difference]: With dead ends: 9498 [2018-12-31 21:12:32,972 INFO L226 Difference]: Without dead ends: 9466 [2018-12-31 21:12:32,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:12:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9466 states. [2018-12-31 21:12:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9466 to 7524. [2018-12-31 21:12:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7524 states. [2018-12-31 21:12:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7524 states to 7524 states and 17032 transitions. [2018-12-31 21:12:33,079 INFO L78 Accepts]: Start accepts. Automaton has 7524 states and 17032 transitions. Word has length 94 [2018-12-31 21:12:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:33,079 INFO L480 AbstractCegarLoop]: Abstraction has 7524 states and 17032 transitions. [2018-12-31 21:12:33,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:12:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7524 states and 17032 transitions. [2018-12-31 21:12:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:33,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:33,089 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] [2018-12-31 21:12:33,089 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1372627064, now seen corresponding path program 1 times [2018-12-31 21:12:33,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:33,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:33,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:33,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:33,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:33,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:33,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:33,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:33,336 INFO L87 Difference]: Start difference. First operand 7524 states and 17032 transitions. Second operand 4 states. [2018-12-31 21:12:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:33,996 INFO L93 Difference]: Finished difference Result 8481 states and 19024 transitions. [2018-12-31 21:12:33,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:12:33,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-31 21:12:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:34,009 INFO L225 Difference]: With dead ends: 8481 [2018-12-31 21:12:34,009 INFO L226 Difference]: Without dead ends: 8414 [2018-12-31 21:12:34,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2018-12-31 21:12:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 7984. [2018-12-31 21:12:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7984 states. [2018-12-31 21:12:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7984 states to 7984 states and 17967 transitions. [2018-12-31 21:12:34,109 INFO L78 Accepts]: Start accepts. Automaton has 7984 states and 17967 transitions. Word has length 96 [2018-12-31 21:12:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:34,109 INFO L480 AbstractCegarLoop]: Abstraction has 7984 states and 17967 transitions. [2018-12-31 21:12:34,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 7984 states and 17967 transitions. [2018-12-31 21:12:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:34,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:34,119 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] [2018-12-31 21:12:34,119 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:34,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash 845130889, now seen corresponding path program 1 times [2018-12-31 21:12:34,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:34,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:34,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:34,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:34,858 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 10 [2018-12-31 21:12:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:34,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:34,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 21:12:34,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 21:12:34,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 21:12:34,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:12:34,959 INFO L87 Difference]: Start difference. First operand 7984 states and 17967 transitions. Second operand 10 states. [2018-12-31 21:12:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:35,926 INFO L93 Difference]: Finished difference Result 10253 states and 22894 transitions. [2018-12-31 21:12:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 21:12:35,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 21:12:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:35,941 INFO L225 Difference]: With dead ends: 10253 [2018-12-31 21:12:35,941 INFO L226 Difference]: Without dead ends: 10253 [2018-12-31 21:12:35,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-31 21:12:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10253 states. [2018-12-31 21:12:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10253 to 9203. [2018-12-31 21:12:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9203 states. [2018-12-31 21:12:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9203 states to 9203 states and 20627 transitions. [2018-12-31 21:12:36,049 INFO L78 Accepts]: Start accepts. Automaton has 9203 states and 20627 transitions. Word has length 96 [2018-12-31 21:12:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:36,051 INFO L480 AbstractCegarLoop]: Abstraction has 9203 states and 20627 transitions. [2018-12-31 21:12:36,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 21:12:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 9203 states and 20627 transitions. [2018-12-31 21:12:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:36,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:36,061 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] [2018-12-31 21:12:36,062 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1732634570, now seen corresponding path program 1 times [2018-12-31 21:12:36,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:36,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:36,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:36,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:36,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:36,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:36,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:12:36,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:12:36,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:12:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:12:36,428 INFO L87 Difference]: Start difference. First operand 9203 states and 20627 transitions. Second operand 7 states. [2018-12-31 21:12:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:36,625 INFO L93 Difference]: Finished difference Result 11920 states and 26646 transitions. [2018-12-31 21:12:36,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:12:36,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 21:12:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:36,639 INFO L225 Difference]: With dead ends: 11920 [2018-12-31 21:12:36,639 INFO L226 Difference]: Without dead ends: 11920 [2018-12-31 21:12:36,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:12:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11920 states. [2018-12-31 21:12:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11920 to 9153. [2018-12-31 21:12:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9153 states. [2018-12-31 21:12:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 20415 transitions. [2018-12-31 21:12:36,753 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 20415 transitions. Word has length 96 [2018-12-31 21:12:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:36,753 INFO L480 AbstractCegarLoop]: Abstraction has 9153 states and 20415 transitions. [2018-12-31 21:12:36,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:12:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 20415 transitions. [2018-12-31 21:12:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:36,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:36,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:12:36,764 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1056481802, now seen corresponding path program 1 times [2018-12-31 21:12:36,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:36,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:36,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:38,110 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 6 [2018-12-31 21:12:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:38,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:38,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:12:38,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:12:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:12:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:12:38,251 INFO L87 Difference]: Start difference. First operand 9153 states and 20415 transitions. Second operand 9 states. [2018-12-31 21:12:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:38,831 INFO L93 Difference]: Finished difference Result 10039 states and 22179 transitions. [2018-12-31 21:12:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 21:12:38,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-31 21:12:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:38,845 INFO L225 Difference]: With dead ends: 10039 [2018-12-31 21:12:38,845 INFO L226 Difference]: Without dead ends: 10039 [2018-12-31 21:12:38,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-31 21:12:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10039 states. [2018-12-31 21:12:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10039 to 7039. [2018-12-31 21:12:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7039 states. [2018-12-31 21:12:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7039 states to 7039 states and 15667 transitions. [2018-12-31 21:12:38,937 INFO L78 Accepts]: Start accepts. Automaton has 7039 states and 15667 transitions. Word has length 96 [2018-12-31 21:12:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:38,938 INFO L480 AbstractCegarLoop]: Abstraction has 7039 states and 15667 transitions. [2018-12-31 21:12:38,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:12:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states and 15667 transitions. [2018-12-31 21:12:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:38,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:38,946 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] [2018-12-31 21:12:38,946 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:38,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1943985483, now seen corresponding path program 1 times [2018-12-31 21:12:38,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:38,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:38,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:39,265 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 21:12:39,443 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 21:12:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:39,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:39,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 21:12:39,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 21:12:39,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 21:12:39,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 21:12:39,555 INFO L87 Difference]: Start difference. First operand 7039 states and 15667 transitions. Second operand 11 states. [2018-12-31 21:12:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:41,393 INFO L93 Difference]: Finished difference Result 13691 states and 30658 transitions. [2018-12-31 21:12:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 21:12:41,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-31 21:12:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:41,407 INFO L225 Difference]: With dead ends: 13691 [2018-12-31 21:12:41,407 INFO L226 Difference]: Without dead ends: 9289 [2018-12-31 21:12:41,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 21:12:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2018-12-31 21:12:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 6880. [2018-12-31 21:12:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6880 states. [2018-12-31 21:12:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6880 states to 6880 states and 15274 transitions. [2018-12-31 21:12:41,495 INFO L78 Accepts]: Start accepts. Automaton has 6880 states and 15274 transitions. Word has length 96 [2018-12-31 21:12:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:41,495 INFO L480 AbstractCegarLoop]: Abstraction has 6880 states and 15274 transitions. [2018-12-31 21:12:41,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 21:12:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6880 states and 15274 transitions. [2018-12-31 21:12:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:41,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:41,504 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] [2018-12-31 21:12:41,504 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1847691802, now seen corresponding path program 1 times [2018-12-31 21:12:41,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:41,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:41,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:41,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:41,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:41,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:41,922 INFO L87 Difference]: Start difference. First operand 6880 states and 15274 transitions. Second operand 5 states. [2018-12-31 21:12:42,626 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 21:12:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:42,887 INFO L93 Difference]: Finished difference Result 6188 states and 13581 transitions. [2018-12-31 21:12:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:12:42,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 21:12:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:42,897 INFO L225 Difference]: With dead ends: 6188 [2018-12-31 21:12:42,897 INFO L226 Difference]: Without dead ends: 6188 [2018-12-31 21:12:42,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6188 states. [2018-12-31 21:12:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6188 to 5804. [2018-12-31 21:12:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5804 states. [2018-12-31 21:12:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 12771 transitions. [2018-12-31 21:12:42,965 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 12771 transitions. Word has length 96 [2018-12-31 21:12:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:42,965 INFO L480 AbstractCegarLoop]: Abstraction has 5804 states and 12771 transitions. [2018-12-31 21:12:42,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 12771 transitions. [2018-12-31 21:12:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:42,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:42,973 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] [2018-12-31 21:12:42,974 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1590223112, now seen corresponding path program 2 times [2018-12-31 21:12:42,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:42,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:43,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:43,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:12:43,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:12:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:12:43,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:12:43,539 INFO L87 Difference]: Start difference. First operand 5804 states and 12771 transitions. Second operand 6 states. [2018-12-31 21:12:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:44,484 INFO L93 Difference]: Finished difference Result 6552 states and 14426 transitions. [2018-12-31 21:12:44,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:44,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 21:12:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:44,496 INFO L225 Difference]: With dead ends: 6552 [2018-12-31 21:12:44,496 INFO L226 Difference]: Without dead ends: 6552 [2018-12-31 21:12:44,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2018-12-31 21:12:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 5964. [2018-12-31 21:12:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2018-12-31 21:12:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 13115 transitions. [2018-12-31 21:12:44,561 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 13115 transitions. Word has length 96 [2018-12-31 21:12:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:44,561 INFO L480 AbstractCegarLoop]: Abstraction has 5964 states and 13115 transitions. [2018-12-31 21:12:44,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:12:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 13115 transitions. [2018-12-31 21:12:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:44,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:44,568 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] [2018-12-31 21:12:44,568 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash -188789864, now seen corresponding path program 1 times [2018-12-31 21:12:44,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:44,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:44,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:44,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:12:44,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:45,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:45,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:12:45,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:12:45,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:12:45,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:45,305 INFO L87 Difference]: Start difference. First operand 5964 states and 13115 transitions. Second operand 8 states. [2018-12-31 21:12:46,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:46,151 INFO L93 Difference]: Finished difference Result 9033 states and 19827 transitions. [2018-12-31 21:12:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 21:12:46,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 21:12:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:46,163 INFO L225 Difference]: With dead ends: 9033 [2018-12-31 21:12:46,163 INFO L226 Difference]: Without dead ends: 8993 [2018-12-31 21:12:46,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-12-31 21:12:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2018-12-31 21:12:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 6492. [2018-12-31 21:12:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6492 states. [2018-12-31 21:12:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 14213 transitions. [2018-12-31 21:12:46,246 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 14213 transitions. Word has length 96 [2018-12-31 21:12:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:46,246 INFO L480 AbstractCegarLoop]: Abstraction has 6492 states and 14213 transitions. [2018-12-31 21:12:46,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:12:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 14213 transitions. [2018-12-31 21:12:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:12:46,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:46,254 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] [2018-12-31 21:12:46,254 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2028968089, now seen corresponding path program 2 times [2018-12-31 21:12:46,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:46,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:46,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:46,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:12:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:12:46,353 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 21:12:46,563 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 21:12:46,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:12:46 BasicIcfg [2018-12-31 21:12:46,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 21:12:46,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 21:12:46,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 21:12:46,566 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 21:12:46,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:11:38" (3/4) ... [2018-12-31 21:12:46,573 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 21:12:46,754 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 21:12:46,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 21:12:46,757 INFO L168 Benchmark]: Toolchain (without parser) took 70516.04 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 944.6 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 733.2 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:46,758 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:12:46,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 957.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:46,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:46,759 INFO L168 Benchmark]: Boogie Preprocessor took 44.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:12:46,759 INFO L168 Benchmark]: RCFGBuilder took 1321.55 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:46,760 INFO L168 Benchmark]: TraceAbstraction took 67925.51 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 653.0 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:46,760 INFO L168 Benchmark]: Witness Printer took 187.88 ms. Allocated memory is still 5.1 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:12:46,764 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 957.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.59 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 1321.55 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67925.51 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 653.0 MB. Max. memory is 11.5 GB. * Witness Printer took 187.88 ms. Allocated memory is still 5.1 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1091; VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1092; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 67.7s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 29.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10611 SDtfs, 11098 SDslu, 24980 SDs, 0 SdLazy, 11776 SolverSat, 623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 105 SyntacticMatches, 37 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 22.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 154125 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 3007 NumberOfCodeBlocks, 3007 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2872 ConstructedInterpolants, 0 QuantifiedInterpolants, 656641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...