./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer --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 73f223ea09ae1d01ec80d75737e558f25a1a2bd2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-cad4683 [2019-11-15 22:22:47,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:22:47,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:22:47,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:22:47,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:22:47,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:22:47,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:22:47,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:22:47,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:22:47,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:22:47,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:22:47,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:22:47,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:22:47,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:22:47,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:22:47,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:22:47,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:22:47,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:22:47,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:22:47,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:22:47,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:22:47,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:22:47,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:22:47,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:22:47,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:22:47,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:22:47,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:22:47,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:22:47,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:22:47,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:22:47,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:22:47,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:22:47,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:22:47,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:22:47,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:22:47,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:22:47,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:22:47,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:22:47,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:22:47,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:22:47,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:22:47,416 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:22:47,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:22:47,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:22:47,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:22:47,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:22:47,437 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:22:47,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:22:47,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:22:47,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:22:47,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:22:47,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:22:47,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:22:47,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:22:47,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:22:47,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:22:47,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:22:47,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:22:47,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:22:47,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:22:47,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:22:47,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:22:47,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:22:47,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:22:47,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:22:47,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:22:47,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:22:47,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:22:47,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:22:47,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:22:47,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer 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 -> 73f223ea09ae1d01ec80d75737e558f25a1a2bd2 [2019-11-15 22:22:47,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:22:47,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:22:47,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:22:47,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:22:47,487 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:22:47,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i [2019-11-15 22:22:47,539 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/data/0d4c2cde4/9e9544d63601402b9f78f86530feaa6c/FLAG1b598a5a9 [2019-11-15 22:22:48,045 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:22:48,047 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i [2019-11-15 22:22:48,063 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/data/0d4c2cde4/9e9544d63601402b9f78f86530feaa6c/FLAG1b598a5a9 [2019-11-15 22:22:48,285 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/data/0d4c2cde4/9e9544d63601402b9f78f86530feaa6c [2019-11-15 22:22:48,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:22:48,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:22:48,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:48,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:22:48,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:22:48,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:48" (1/1) ... [2019-11-15 22:22:48,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54151c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:48, skipping insertion in model container [2019-11-15 22:22:48,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:48" (1/1) ... [2019-11-15 22:22:48,305 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:22:48,376 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:22:48,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:48,905 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:22:48,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:49,073 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:22:49,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49 WrapperNode [2019-11-15 22:22:49,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:49,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:49,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:22:49,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:22:49,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:49,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:22:49,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:22:49,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:22:49,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... [2019-11-15 22:22:49,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:22:49,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:22:49,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:22:49,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:22:49,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:22:49,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:22:49,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:22:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:22:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:22:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:22:49,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:22:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:22:49,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:22:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:22:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:22:49,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:22:49,266 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 22:22:50,013 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:22:50,014 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:22:50,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:50 BoogieIcfgContainer [2019-11-15 22:22:50,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:22:50,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:22:50,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:22:50,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:22:50,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:22:48" (1/3) ... [2019-11-15 22:22:50,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7498d504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:22:50, skipping insertion in model container [2019-11-15 22:22:50,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:49" (2/3) ... [2019-11-15 22:22:50,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7498d504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:22:50, skipping insertion in model container [2019-11-15 22:22:50,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:50" (3/3) ... [2019-11-15 22:22:50,026 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2019-11-15 22:22:50,060 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,061 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,061 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,061 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,061 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,061 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,062 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,062 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,065 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,065 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,065 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,065 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,065 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,066 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,066 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,066 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,066 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,066 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,067 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,067 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,069 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,069 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,083 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,084 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,087 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,088 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,088 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,089 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,089 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,090 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,090 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,091 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:22:50,119 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:22:50,119 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:22:50,127 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:22:50,137 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:22:50,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:22:50,165 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:22:50,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:22:50,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:22:50,165 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:22:50,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:22:50,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:22:50,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:22:50,183 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-15 22:22:52,937 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-11-15 22:22:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-11-15 22:22:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:22:52,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:52,946 INFO L380 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] [2019-11-15 22:22:52,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 406875446, now seen corresponding path program 1 times [2019-11-15 22:22:52,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:52,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490679433] [2019-11-15 22:22:52,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:52,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:52,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:53,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490679433] [2019-11-15 22:22:53,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:53,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:53,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823929126] [2019-11-15 22:22:53,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:53,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:53,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:53,264 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-11-15 22:22:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:54,334 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-11-15 22:22:54,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:54,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 22:22:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:54,622 INFO L225 Difference]: With dead ends: 33591 [2019-11-15 22:22:54,622 INFO L226 Difference]: Without dead ends: 25703 [2019-11-15 22:22:54,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-11-15 22:22:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-11-15 22:22:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-11-15 22:22:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-11-15 22:22:56,025 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-11-15 22:22:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:56,026 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-11-15 22:22:56,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-11-15 22:22:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:22:56,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:56,036 INFO L380 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] [2019-11-15 22:22:56,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash -92700470, now seen corresponding path program 1 times [2019-11-15 22:22:56,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:56,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845786840] [2019-11-15 22:22:56,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:56,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:56,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:56,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845786840] [2019-11-15 22:22:56,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:56,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:22:56,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476703823] [2019-11-15 22:22:56,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:22:56,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:22:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:22:56,227 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-11-15 22:22:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:57,548 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-11-15 22:22:57,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:22:57,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 22:22:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:57,735 INFO L225 Difference]: With dead ends: 41081 [2019-11-15 22:22:57,736 INFO L226 Difference]: Without dead ends: 40545 [2019-11-15 22:22:57,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:22:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-11-15 22:22:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-11-15 22:22:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-11-15 22:22:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-11-15 22:22:59,397 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-11-15 22:22:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:59,399 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-11-15 22:22:59,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:22:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-11-15 22:22:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:22:59,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:59,408 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:59,409 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash 641615998, now seen corresponding path program 1 times [2019-11-15 22:22:59,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:59,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143846339] [2019-11-15 22:22:59,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:59,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:59,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:59,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143846339] [2019-11-15 22:22:59,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:59,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:22:59,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366650966] [2019-11-15 22:22:59,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:22:59,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:22:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:22:59,510 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-11-15 22:23:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:00,827 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-11-15 22:23:00,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:23:00,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 22:23:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:01,022 INFO L225 Difference]: With dead ends: 49778 [2019-11-15 22:23:01,023 INFO L226 Difference]: Without dead ends: 49274 [2019-11-15 22:23:01,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:23:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-11-15 22:23:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-11-15 22:23:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-11-15 22:23:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-11-15 22:23:02,286 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-11-15 22:23:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:02,286 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-11-15 22:23:02,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-11-15 22:23:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:23:02,302 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:02,302 INFO L380 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] [2019-11-15 22:23:02,303 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash -911086108, now seen corresponding path program 1 times [2019-11-15 22:23:02,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:02,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892691485] [2019-11-15 22:23:02,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:02,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:02,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:02,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892691485] [2019-11-15 22:23:02,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:02,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:23:02,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071428543] [2019-11-15 22:23:02,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:23:02,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:02,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:23:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:02,393 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-11-15 22:23:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:02,752 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-11-15 22:23:02,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:23:02,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 22:23:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:03,735 INFO L225 Difference]: With dead ends: 61087 [2019-11-15 22:23:03,735 INFO L226 Difference]: Without dead ends: 61087 [2019-11-15 22:23:03,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-11-15 22:23:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-11-15 22:23:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-11-15 22:23:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-11-15 22:23:04,744 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-11-15 22:23:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:04,744 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-11-15 22:23:04,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:23:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-11-15 22:23:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:23:04,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:04,766 INFO L380 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] [2019-11-15 22:23:04,766 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:04,767 INFO L82 PathProgramCache]: Analyzing trace with hash -353012429, now seen corresponding path program 1 times [2019-11-15 22:23:04,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:04,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542116403] [2019-11-15 22:23:04,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:04,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:04,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:04,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542116403] [2019-11-15 22:23:04,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:04,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:04,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010951243] [2019-11-15 22:23:04,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:04,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:04,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:04,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:04,907 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-11-15 22:23:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:06,852 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-11-15 22:23:06,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:23:06,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 22:23:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:07,003 INFO L225 Difference]: With dead ends: 63756 [2019-11-15 22:23:07,003 INFO L226 Difference]: Without dead ends: 63756 [2019-11-15 22:23:07,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:23:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-11-15 22:23:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-11-15 22:23:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-11-15 22:23:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-11-15 22:23:08,238 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-11-15 22:23:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:08,238 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-11-15 22:23:08,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-11-15 22:23:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:23:08,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:08,259 INFO L380 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] [2019-11-15 22:23:08,259 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2145003508, now seen corresponding path program 1 times [2019-11-15 22:23:08,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:08,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047543939] [2019-11-15 22:23:08,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:08,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:08,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:08,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047543939] [2019-11-15 22:23:08,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:08,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:23:08,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498257161] [2019-11-15 22:23:08,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:08,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:08,383 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-11-15 22:23:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:12,884 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-11-15 22:23:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:23:12,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 22:23:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:13,060 INFO L225 Difference]: With dead ends: 83685 [2019-11-15 22:23:13,060 INFO L226 Difference]: Without dead ends: 83685 [2019-11-15 22:23:13,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:23:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-11-15 22:23:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-11-15 22:23:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-11-15 22:23:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-11-15 22:23:14,462 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-11-15 22:23:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-11-15 22:23:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-11-15 22:23:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:23:14,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:14,477 INFO L380 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] [2019-11-15 22:23:14,477 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:14,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1262460107, now seen corresponding path program 1 times [2019-11-15 22:23:14,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:14,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323763223] [2019-11-15 22:23:14,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:14,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:14,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:14,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323763223] [2019-11-15 22:23:14,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:14,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:14,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006310398] [2019-11-15 22:23:14,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:14,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:14,552 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 4 states. [2019-11-15 22:23:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:14,630 INFO L93 Difference]: Finished difference Result 12159 states and 37829 transitions. [2019-11-15 22:23:14,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:23:14,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 22:23:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:14,650 INFO L225 Difference]: With dead ends: 12159 [2019-11-15 22:23:14,650 INFO L226 Difference]: Without dead ends: 10674 [2019-11-15 22:23:14,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2019-11-15 22:23:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10625. [2019-11-15 22:23:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-11-15 22:23:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 32591 transitions. [2019-11-15 22:23:15,401 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 32591 transitions. Word has length 53 [2019-11-15 22:23:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:15,401 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 32591 transitions. [2019-11-15 22:23:15,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 32591 transitions. [2019-11-15 22:23:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:23:15,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:15,418 INFO L380 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] [2019-11-15 22:23:15,419 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:15,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:15,419 INFO L82 PathProgramCache]: Analyzing trace with hash 348030127, now seen corresponding path program 1 times [2019-11-15 22:23:15,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:15,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123854452] [2019-11-15 22:23:15,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:15,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:15,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:15,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123854452] [2019-11-15 22:23:15,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:15,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:15,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241263669] [2019-11-15 22:23:15,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:15,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:15,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:15,543 INFO L87 Difference]: Start difference. First operand 10625 states and 32591 transitions. Second operand 6 states. [2019-11-15 22:23:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:16,043 INFO L93 Difference]: Finished difference Result 13182 states and 39872 transitions. [2019-11-15 22:23:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:23:16,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 22:23:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:16,069 INFO L225 Difference]: With dead ends: 13182 [2019-11-15 22:23:16,069 INFO L226 Difference]: Without dead ends: 13119 [2019-11-15 22:23:16,071 INFO L600 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 [2019-11-15 22:23:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2019-11-15 22:23:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11048. [2019-11-15 22:23:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-11-15 22:23:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 33785 transitions. [2019-11-15 22:23:16,268 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 33785 transitions. Word has length 53 [2019-11-15 22:23:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:16,268 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 33785 transitions. [2019-11-15 22:23:16,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 33785 transitions. [2019-11-15 22:23:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:23:16,271 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:16,271 INFO L380 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] [2019-11-15 22:23:16,272 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:16,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1800830091, now seen corresponding path program 1 times [2019-11-15 22:23:16,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:16,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768482595] [2019-11-15 22:23:16,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:16,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:16,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:16,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768482595] [2019-11-15 22:23:16,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:16,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:16,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121100964] [2019-11-15 22:23:16,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:16,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:16,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:16,337 INFO L87 Difference]: Start difference. First operand 11048 states and 33785 transitions. Second operand 4 states. [2019-11-15 22:23:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:16,480 INFO L93 Difference]: Finished difference Result 12862 states and 39391 transitions. [2019-11-15 22:23:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:23:16,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 22:23:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:16,500 INFO L225 Difference]: With dead ends: 12862 [2019-11-15 22:23:16,500 INFO L226 Difference]: Without dead ends: 12862 [2019-11-15 22:23:16,500 INFO L600 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 [2019-11-15 22:23:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-11-15 22:23:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 11693. [2019-11-15 22:23:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-11-15 22:23:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35762 transitions. [2019-11-15 22:23:16,663 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35762 transitions. Word has length 61 [2019-11-15 22:23:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:16,664 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35762 transitions. [2019-11-15 22:23:16,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35762 transitions. [2019-11-15 22:23:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:23:16,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:16,668 INFO L380 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] [2019-11-15 22:23:16,668 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash -751326870, now seen corresponding path program 1 times [2019-11-15 22:23:16,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:16,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281682768] [2019-11-15 22:23:16,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:16,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:16,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:16,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281682768] [2019-11-15 22:23:16,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:16,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:16,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383519698] [2019-11-15 22:23:16,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:16,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:16,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:16,737 INFO L87 Difference]: Start difference. First operand 11693 states and 35762 transitions. Second operand 6 states. [2019-11-15 22:23:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:17,221 INFO L93 Difference]: Finished difference Result 14219 states and 42860 transitions. [2019-11-15 22:23:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:23:17,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 22:23:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:17,247 INFO L225 Difference]: With dead ends: 14219 [2019-11-15 22:23:17,247 INFO L226 Difference]: Without dead ends: 14158 [2019-11-15 22:23:17,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:23:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-11-15 22:23:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 13461. [2019-11-15 22:23:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-11-15 22:23:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 40779 transitions. [2019-11-15 22:23:17,444 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 40779 transitions. Word has length 61 [2019-11-15 22:23:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:17,444 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 40779 transitions. [2019-11-15 22:23:17,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 40779 transitions. [2019-11-15 22:23:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:23:17,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:17,450 INFO L380 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] [2019-11-15 22:23:17,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1904585144, now seen corresponding path program 1 times [2019-11-15 22:23:17,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:17,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644045494] [2019-11-15 22:23:17,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:17,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:17,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:17,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644045494] [2019-11-15 22:23:17,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:17,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:17,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529987158] [2019-11-15 22:23:17,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:17,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:17,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:17,492 INFO L87 Difference]: Start difference. First operand 13461 states and 40779 transitions. Second operand 4 states. [2019-11-15 22:23:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:17,947 INFO L93 Difference]: Finished difference Result 18895 states and 55937 transitions. [2019-11-15 22:23:17,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:23:17,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 22:23:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:17,972 INFO L225 Difference]: With dead ends: 18895 [2019-11-15 22:23:17,973 INFO L226 Difference]: Without dead ends: 18847 [2019-11-15 22:23:17,975 INFO L600 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 [2019-11-15 22:23:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2019-11-15 22:23:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 14874. [2019-11-15 22:23:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14874 states. [2019-11-15 22:23:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 44559 transitions. [2019-11-15 22:23:18,189 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 44559 transitions. Word has length 65 [2019-11-15 22:23:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:18,189 INFO L462 AbstractCegarLoop]: Abstraction has 14874 states and 44559 transitions. [2019-11-15 22:23:18,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 44559 transitions. [2019-11-15 22:23:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:23:18,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:18,197 INFO L380 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] [2019-11-15 22:23:18,198 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1971591897, now seen corresponding path program 1 times [2019-11-15 22:23:18,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:18,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148397892] [2019-11-15 22:23:18,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:18,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:18,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:18,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148397892] [2019-11-15 22:23:18,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:18,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:18,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428226761] [2019-11-15 22:23:18,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:18,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:18,252 INFO L87 Difference]: Start difference. First operand 14874 states and 44559 transitions. Second operand 4 states. [2019-11-15 22:23:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:18,632 INFO L93 Difference]: Finished difference Result 18169 states and 53762 transitions. [2019-11-15 22:23:18,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:23:18,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 22:23:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:18,665 INFO L225 Difference]: With dead ends: 18169 [2019-11-15 22:23:18,666 INFO L226 Difference]: Without dead ends: 18169 [2019-11-15 22:23:18,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-11-15 22:23:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 15114. [2019-11-15 22:23:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15114 states. [2019-11-15 22:23:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15114 states to 15114 states and 45207 transitions. [2019-11-15 22:23:18,957 INFO L78 Accepts]: Start accepts. Automaton has 15114 states and 45207 transitions. Word has length 65 [2019-11-15 22:23:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:18,957 INFO L462 AbstractCegarLoop]: Abstraction has 15114 states and 45207 transitions. [2019-11-15 22:23:18,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 15114 states and 45207 transitions. [2019-11-15 22:23:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:23:18,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:18,968 INFO L380 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] [2019-11-15 22:23:18,968 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2002611704, now seen corresponding path program 1 times [2019-11-15 22:23:18,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:18,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748183599] [2019-11-15 22:23:18,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:18,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:18,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:19,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748183599] [2019-11-15 22:23:19,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:19,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:23:19,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961017948] [2019-11-15 22:23:19,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:23:19,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:19,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:23:19,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:19,014 INFO L87 Difference]: Start difference. First operand 15114 states and 45207 transitions. Second operand 3 states. [2019-11-15 22:23:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:19,265 INFO L93 Difference]: Finished difference Result 15542 states and 46331 transitions. [2019-11-15 22:23:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:23:19,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-15 22:23:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:19,287 INFO L225 Difference]: With dead ends: 15542 [2019-11-15 22:23:19,287 INFO L226 Difference]: Without dead ends: 15542 [2019-11-15 22:23:19,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-11-15 22:23:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15328. [2019-11-15 22:23:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-11-15 22:23:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 45749 transitions. [2019-11-15 22:23:19,489 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 45749 transitions. Word has length 65 [2019-11-15 22:23:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:19,489 INFO L462 AbstractCegarLoop]: Abstraction has 15328 states and 45749 transitions. [2019-11-15 22:23:19,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:23:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 45749 transitions. [2019-11-15 22:23:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:23:19,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:19,497 INFO L380 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] [2019-11-15 22:23:19,497 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -361882466, now seen corresponding path program 1 times [2019-11-15 22:23:19,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:19,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004957663] [2019-11-15 22:23:19,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:19,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:19,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:19,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004957663] [2019-11-15 22:23:19,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:19,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:19,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265470678] [2019-11-15 22:23:19,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:19,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:19,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:19,591 INFO L87 Difference]: Start difference. First operand 15328 states and 45749 transitions. Second operand 6 states. [2019-11-15 22:23:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:20,013 INFO L93 Difference]: Finished difference Result 16701 states and 48916 transitions. [2019-11-15 22:23:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:23:20,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 22:23:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:20,039 INFO L225 Difference]: With dead ends: 16701 [2019-11-15 22:23:20,039 INFO L226 Difference]: Without dead ends: 16701 [2019-11-15 22:23:20,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:23:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2019-11-15 22:23:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 15510. [2019-11-15 22:23:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15510 states. [2019-11-15 22:23:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 45935 transitions. [2019-11-15 22:23:20,291 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 45935 transitions. Word has length 67 [2019-11-15 22:23:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:20,291 INFO L462 AbstractCegarLoop]: Abstraction has 15510 states and 45935 transitions. [2019-11-15 22:23:20,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 45935 transitions. [2019-11-15 22:23:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:23:20,302 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:20,302 INFO L380 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] [2019-11-15 22:23:20,302 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1895028541, now seen corresponding path program 1 times [2019-11-15 22:23:20,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:20,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517910816] [2019-11-15 22:23:20,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:20,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:20,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:20,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517910816] [2019-11-15 22:23:20,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:20,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:23:20,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497657836] [2019-11-15 22:23:20,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:23:20,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:23:20,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:20,384 INFO L87 Difference]: Start difference. First operand 15510 states and 45935 transitions. Second operand 5 states. [2019-11-15 22:23:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:20,984 INFO L93 Difference]: Finished difference Result 19681 states and 57982 transitions. [2019-11-15 22:23:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:23:20,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 22:23:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:21,012 INFO L225 Difference]: With dead ends: 19681 [2019-11-15 22:23:21,013 INFO L226 Difference]: Without dead ends: 19681 [2019-11-15 22:23:21,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19681 states. [2019-11-15 22:23:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19681 to 18165. [2019-11-15 22:23:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-11-15 22:23:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 53469 transitions. [2019-11-15 22:23:21,274 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 53469 transitions. Word has length 67 [2019-11-15 22:23:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:21,274 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 53469 transitions. [2019-11-15 22:23:21,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 53469 transitions. [2019-11-15 22:23:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:23:21,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:21,285 INFO L380 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] [2019-11-15 22:23:21,286 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:21,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1384494364, now seen corresponding path program 1 times [2019-11-15 22:23:21,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:21,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529194505] [2019-11-15 22:23:21,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:21,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:21,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:21,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529194505] [2019-11-15 22:23:21,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:21,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:23:21,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297178266] [2019-11-15 22:23:21,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:23:21,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:23:21,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:21,377 INFO L87 Difference]: Start difference. First operand 18165 states and 53469 transitions. Second operand 5 states. [2019-11-15 22:23:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:21,895 INFO L93 Difference]: Finished difference Result 26550 states and 77182 transitions. [2019-11-15 22:23:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:23:21,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 22:23:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:21,935 INFO L225 Difference]: With dead ends: 26550 [2019-11-15 22:23:21,936 INFO L226 Difference]: Without dead ends: 26550 [2019-11-15 22:23:21,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:23:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-11-15 22:23:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 21618. [2019-11-15 22:23:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-11-15 22:23:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 62902 transitions. [2019-11-15 22:23:22,261 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 62902 transitions. Word has length 67 [2019-11-15 22:23:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:22,261 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 62902 transitions. [2019-11-15 22:23:22,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 62902 transitions. [2019-11-15 22:23:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:23:22,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:22,274 INFO L380 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] [2019-11-15 22:23:22,274 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash -422960099, now seen corresponding path program 1 times [2019-11-15 22:23:22,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:22,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21325410] [2019-11-15 22:23:22,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:22,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:22,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:22,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21325410] [2019-11-15 22:23:22,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:22,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:22,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087265317] [2019-11-15 22:23:22,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:22,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:22,339 INFO L87 Difference]: Start difference. First operand 21618 states and 62902 transitions. Second operand 4 states. [2019-11-15 22:23:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:22,932 INFO L93 Difference]: Finished difference Result 28143 states and 82198 transitions. [2019-11-15 22:23:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:23:22,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:23:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:22,975 INFO L225 Difference]: With dead ends: 28143 [2019-11-15 22:23:22,975 INFO L226 Difference]: Without dead ends: 28008 [2019-11-15 22:23:22,976 INFO L600 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 [2019-11-15 22:23:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-11-15 22:23:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 26043. [2019-11-15 22:23:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2019-11-15 22:23:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 76088 transitions. [2019-11-15 22:23:23,355 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 76088 transitions. Word has length 67 [2019-11-15 22:23:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:23,355 INFO L462 AbstractCegarLoop]: Abstraction has 26043 states and 76088 transitions. [2019-11-15 22:23:23,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 76088 transitions. [2019-11-15 22:23:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:23:23,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:23,365 INFO L380 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] [2019-11-15 22:23:23,365 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2075055838, now seen corresponding path program 1 times [2019-11-15 22:23:23,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:23,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681217682] [2019-11-15 22:23:23,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:23,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:23,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:23,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681217682] [2019-11-15 22:23:23,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:23,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:23:23,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538166984] [2019-11-15 22:23:23,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:23:23,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:23:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:23,463 INFO L87 Difference]: Start difference. First operand 26043 states and 76088 transitions. Second operand 5 states. [2019-11-15 22:23:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:23,528 INFO L93 Difference]: Finished difference Result 6987 states and 16662 transitions. [2019-11-15 22:23:23,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:23:23,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 22:23:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:23,535 INFO L225 Difference]: With dead ends: 6987 [2019-11-15 22:23:23,535 INFO L226 Difference]: Without dead ends: 5679 [2019-11-15 22:23:23,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2019-11-15 22:23:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 4422. [2019-11-15 22:23:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-11-15 22:23:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 10396 transitions. [2019-11-15 22:23:23,597 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 10396 transitions. Word has length 67 [2019-11-15 22:23:23,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:23,597 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 10396 transitions. [2019-11-15 22:23:23,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 10396 transitions. [2019-11-15 22:23:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:23:23,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:23,601 INFO L380 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] [2019-11-15 22:23:23,601 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:23,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:23,601 INFO L82 PathProgramCache]: Analyzing trace with hash 27147227, now seen corresponding path program 1 times [2019-11-15 22:23:23,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:23,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312877711] [2019-11-15 22:23:23,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:23,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:23,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:23,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312877711] [2019-11-15 22:23:23,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:23,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:23:23,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355425084] [2019-11-15 22:23:23,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:23:23,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:23:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:23,635 INFO L87 Difference]: Start difference. First operand 4422 states and 10396 transitions. Second operand 3 states. [2019-11-15 22:23:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:23,696 INFO L93 Difference]: Finished difference Result 5917 states and 13768 transitions. [2019-11-15 22:23:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:23:23,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 22:23:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:23,703 INFO L225 Difference]: With dead ends: 5917 [2019-11-15 22:23:23,703 INFO L226 Difference]: Without dead ends: 5917 [2019-11-15 22:23:23,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2019-11-15 22:23:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 4365. [2019-11-15 22:23:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-11-15 22:23:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 10043 transitions. [2019-11-15 22:23:23,772 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 10043 transitions. Word has length 67 [2019-11-15 22:23:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:23,772 INFO L462 AbstractCegarLoop]: Abstraction has 4365 states and 10043 transitions. [2019-11-15 22:23:23,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:23:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 10043 transitions. [2019-11-15 22:23:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:23:23,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:23,778 INFO L380 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] [2019-11-15 22:23:23,778 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1559333934, now seen corresponding path program 1 times [2019-11-15 22:23:23,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:23,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845222319] [2019-11-15 22:23:23,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:23,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:23,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:23,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845222319] [2019-11-15 22:23:23,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:23,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:23:23,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917810091] [2019-11-15 22:23:23,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:23:23,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:23,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:23:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:23,876 INFO L87 Difference]: Start difference. First operand 4365 states and 10043 transitions. Second operand 5 states. [2019-11-15 22:23:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:24,024 INFO L93 Difference]: Finished difference Result 5332 states and 12274 transitions. [2019-11-15 22:23:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:23:24,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-15 22:23:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:24,029 INFO L225 Difference]: With dead ends: 5332 [2019-11-15 22:23:24,029 INFO L226 Difference]: Without dead ends: 5332 [2019-11-15 22:23:24,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:23:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2019-11-15 22:23:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 4751. [2019-11-15 22:23:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4751 states. [2019-11-15 22:23:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 4751 states and 10932 transitions. [2019-11-15 22:23:24,078 INFO L78 Accepts]: Start accepts. Automaton has 4751 states and 10932 transitions. Word has length 73 [2019-11-15 22:23:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:24,078 INFO L462 AbstractCegarLoop]: Abstraction has 4751 states and 10932 transitions. [2019-11-15 22:23:24,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4751 states and 10932 transitions. [2019-11-15 22:23:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:23:24,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:24,082 INFO L380 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] [2019-11-15 22:23:24,082 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash -992823027, now seen corresponding path program 1 times [2019-11-15 22:23:24,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:24,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581141857] [2019-11-15 22:23:24,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:24,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:24,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:24,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581141857] [2019-11-15 22:23:24,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:24,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:23:24,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851596698] [2019-11-15 22:23:24,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:24,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:24,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:24,177 INFO L87 Difference]: Start difference. First operand 4751 states and 10932 transitions. Second operand 7 states. [2019-11-15 22:23:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:24,652 INFO L93 Difference]: Finished difference Result 5680 states and 12932 transitions. [2019-11-15 22:23:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:23:24,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-15 22:23:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:24,657 INFO L225 Difference]: With dead ends: 5680 [2019-11-15 22:23:24,657 INFO L226 Difference]: Without dead ends: 5627 [2019-11-15 22:23:24,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:23:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2019-11-15 22:23:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 4809. [2019-11-15 22:23:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4809 states. [2019-11-15 22:23:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 10981 transitions. [2019-11-15 22:23:24,708 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 10981 transitions. Word has length 73 [2019-11-15 22:23:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:24,708 INFO L462 AbstractCegarLoop]: Abstraction has 4809 states and 10981 transitions. [2019-11-15 22:23:24,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 10981 transitions. [2019-11-15 22:23:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:23:24,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:24,715 INFO L380 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] [2019-11-15 22:23:24,715 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:24,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash -965064461, now seen corresponding path program 1 times [2019-11-15 22:23:24,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:24,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917617927] [2019-11-15 22:23:24,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:24,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:24,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:24,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917617927] [2019-11-15 22:23:24,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:24,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:23:24,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786755027] [2019-11-15 22:23:24,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:23:24,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:24,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:23:24,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:24,768 INFO L87 Difference]: Start difference. First operand 4809 states and 10981 transitions. Second operand 3 states. [2019-11-15 22:23:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:24,974 INFO L93 Difference]: Finished difference Result 6433 states and 14300 transitions. [2019-11-15 22:23:24,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:23:24,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 22:23:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:24,981 INFO L225 Difference]: With dead ends: 6433 [2019-11-15 22:23:24,982 INFO L226 Difference]: Without dead ends: 6142 [2019-11-15 22:23:24,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:23:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2019-11-15 22:23:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 5643. [2019-11-15 22:23:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5643 states. [2019-11-15 22:23:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5643 states to 5643 states and 12707 transitions. [2019-11-15 22:23:25,062 INFO L78 Accepts]: Start accepts. Automaton has 5643 states and 12707 transitions. Word has length 92 [2019-11-15 22:23:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:25,062 INFO L462 AbstractCegarLoop]: Abstraction has 5643 states and 12707 transitions. [2019-11-15 22:23:25,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:23:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 12707 transitions. [2019-11-15 22:23:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:23:25,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:25,068 INFO L380 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] [2019-11-15 22:23:25,068 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1126436233, now seen corresponding path program 1 times [2019-11-15 22:23:25,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:25,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972203949] [2019-11-15 22:23:25,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:25,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:25,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:25,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972203949] [2019-11-15 22:23:25,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:25,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:25,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278662076] [2019-11-15 22:23:25,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:25,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:25,145 INFO L87 Difference]: Start difference. First operand 5643 states and 12707 transitions. Second operand 4 states. [2019-11-15 22:23:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:25,275 INFO L93 Difference]: Finished difference Result 6001 states and 13550 transitions. [2019-11-15 22:23:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:23:25,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 22:23:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:25,282 INFO L225 Difference]: With dead ends: 6001 [2019-11-15 22:23:25,282 INFO L226 Difference]: Without dead ends: 6001 [2019-11-15 22:23:25,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2019-11-15 22:23:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5588. [2019-11-15 22:23:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5588 states. [2019-11-15 22:23:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 12666 transitions. [2019-11-15 22:23:25,364 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 12666 transitions. Word has length 92 [2019-11-15 22:23:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:25,365 INFO L462 AbstractCegarLoop]: Abstraction has 5588 states and 12666 transitions. [2019-11-15 22:23:25,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 12666 transitions. [2019-11-15 22:23:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:25,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:25,372 INFO L380 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] [2019-11-15 22:23:25,372 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash 982770137, now seen corresponding path program 1 times [2019-11-15 22:23:25,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:25,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446787015] [2019-11-15 22:23:25,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:25,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:25,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:25,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446787015] [2019-11-15 22:23:25,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:25,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:23:25,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117203870] [2019-11-15 22:23:25,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:23:25,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:23:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:25,439 INFO L87 Difference]: Start difference. First operand 5588 states and 12666 transitions. Second operand 5 states. [2019-11-15 22:23:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:25,568 INFO L93 Difference]: Finished difference Result 6497 states and 14647 transitions. [2019-11-15 22:23:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:23:25,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 22:23:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:25,576 INFO L225 Difference]: With dead ends: 6497 [2019-11-15 22:23:25,576 INFO L226 Difference]: Without dead ends: 6497 [2019-11-15 22:23:25,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-15 22:23:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5002. [2019-11-15 22:23:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5002 states. [2019-11-15 22:23:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 11317 transitions. [2019-11-15 22:23:25,655 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 11317 transitions. Word has length 94 [2019-11-15 22:23:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:25,655 INFO L462 AbstractCegarLoop]: Abstraction has 5002 states and 11317 transitions. [2019-11-15 22:23:25,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 11317 transitions. [2019-11-15 22:23:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:25,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:25,662 INFO L380 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] [2019-11-15 22:23:25,662 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:25,663 INFO L82 PathProgramCache]: Analyzing trace with hash 728033592, now seen corresponding path program 1 times [2019-11-15 22:23:25,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:25,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781659898] [2019-11-15 22:23:25,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:25,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:25,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:25,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781659898] [2019-11-15 22:23:25,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:25,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:23:25,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079067528] [2019-11-15 22:23:25,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:23:25,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:25,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:23:25,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:25,729 INFO L87 Difference]: Start difference. First operand 5002 states and 11317 transitions. Second operand 5 states. [2019-11-15 22:23:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:26,170 INFO L93 Difference]: Finished difference Result 8089 states and 18313 transitions. [2019-11-15 22:23:26,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:23:26,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 22:23:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:26,177 INFO L225 Difference]: With dead ends: 8089 [2019-11-15 22:23:26,177 INFO L226 Difference]: Without dead ends: 8075 [2019-11-15 22:23:26,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:23:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2019-11-15 22:23:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 5781. [2019-11-15 22:23:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5781 states. [2019-11-15 22:23:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 13148 transitions. [2019-11-15 22:23:26,245 INFO L78 Accepts]: Start accepts. Automaton has 5781 states and 13148 transitions. Word has length 94 [2019-11-15 22:23:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:26,245 INFO L462 AbstractCegarLoop]: Abstraction has 5781 states and 13148 transitions. [2019-11-15 22:23:26,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 5781 states and 13148 transitions. [2019-11-15 22:23:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:26,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:26,250 INFO L380 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] [2019-11-15 22:23:26,250 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1972798073, now seen corresponding path program 1 times [2019-11-15 22:23:26,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:26,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365488847] [2019-11-15 22:23:26,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:26,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:26,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:26,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365488847] [2019-11-15 22:23:26,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:26,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:26,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712175494] [2019-11-15 22:23:26,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:26,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:26,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:26,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:26,334 INFO L87 Difference]: Start difference. First operand 5781 states and 13148 transitions. Second operand 6 states. [2019-11-15 22:23:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:26,711 INFO L93 Difference]: Finished difference Result 7670 states and 17182 transitions. [2019-11-15 22:23:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:23:26,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 22:23:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:26,721 INFO L225 Difference]: With dead ends: 7670 [2019-11-15 22:23:26,721 INFO L226 Difference]: Without dead ends: 7670 [2019-11-15 22:23:26,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:23:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2019-11-15 22:23:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 5893. [2019-11-15 22:23:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5893 states. [2019-11-15 22:23:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 13284 transitions. [2019-11-15 22:23:26,815 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 13284 transitions. Word has length 94 [2019-11-15 22:23:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:26,816 INFO L462 AbstractCegarLoop]: Abstraction has 5893 states and 13284 transitions. [2019-11-15 22:23:26,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 13284 transitions. [2019-11-15 22:23:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:26,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:26,823 INFO L380 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] [2019-11-15 22:23:26,824 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash -920587442, now seen corresponding path program 1 times [2019-11-15 22:23:26,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:26,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669341673] [2019-11-15 22:23:26,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:26,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:26,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:27,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669341673] [2019-11-15 22:23:27,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:27,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:23:27,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493165218] [2019-11-15 22:23:27,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:27,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:27,019 INFO L87 Difference]: Start difference. First operand 5893 states and 13284 transitions. Second operand 7 states. [2019-11-15 22:23:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:27,278 INFO L93 Difference]: Finished difference Result 7762 states and 17252 transitions. [2019-11-15 22:23:27,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:23:27,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 22:23:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:27,284 INFO L225 Difference]: With dead ends: 7762 [2019-11-15 22:23:27,285 INFO L226 Difference]: Without dead ends: 7664 [2019-11-15 22:23:27,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:23:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7664 states. [2019-11-15 22:23:27,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7664 to 6343. [2019-11-15 22:23:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6343 states. [2019-11-15 22:23:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 14227 transitions. [2019-11-15 22:23:27,358 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 14227 transitions. Word has length 94 [2019-11-15 22:23:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:27,358 INFO L462 AbstractCegarLoop]: Abstraction has 6343 states and 14227 transitions. [2019-11-15 22:23:27,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 14227 transitions. [2019-11-15 22:23:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:27,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:27,366 INFO L380 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] [2019-11-15 22:23:27,366 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2044175091, now seen corresponding path program 1 times [2019-11-15 22:23:27,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:27,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34318675] [2019-11-15 22:23:27,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:27,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:27,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:27,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34318675] [2019-11-15 22:23:27,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:27,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:23:27,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375091369] [2019-11-15 22:23:27,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:23:27,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:27,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:23:27,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:23:27,517 INFO L87 Difference]: Start difference. First operand 6343 states and 14227 transitions. Second operand 9 states. [2019-11-15 22:23:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:28,308 INFO L93 Difference]: Finished difference Result 8984 states and 20052 transitions. [2019-11-15 22:23:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:23:28,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-15 22:23:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:28,320 INFO L225 Difference]: With dead ends: 8984 [2019-11-15 22:23:28,320 INFO L226 Difference]: Without dead ends: 8966 [2019-11-15 22:23:28,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:23:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-11-15 22:23:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 7988. [2019-11-15 22:23:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7988 states. [2019-11-15 22:23:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7988 states to 7988 states and 17848 transitions. [2019-11-15 22:23:28,445 INFO L78 Accepts]: Start accepts. Automaton has 7988 states and 17848 transitions. Word has length 94 [2019-11-15 22:23:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:28,445 INFO L462 AbstractCegarLoop]: Abstraction has 7988 states and 17848 transitions. [2019-11-15 22:23:28,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:23:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 7988 states and 17848 transitions. [2019-11-15 22:23:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:28,456 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:28,457 INFO L380 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] [2019-11-15 22:23:28,457 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash 453840846, now seen corresponding path program 1 times [2019-11-15 22:23:28,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:28,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532994271] [2019-11-15 22:23:28,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:28,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:28,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:28,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532994271] [2019-11-15 22:23:28,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:28,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:23:28,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937480976] [2019-11-15 22:23:28,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:28,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:28,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:28,569 INFO L87 Difference]: Start difference. First operand 7988 states and 17848 transitions. Second operand 7 states. [2019-11-15 22:23:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:28,958 INFO L93 Difference]: Finished difference Result 11496 states and 25605 transitions. [2019-11-15 22:23:28,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:23:28,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 22:23:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:28,968 INFO L225 Difference]: With dead ends: 11496 [2019-11-15 22:23:28,968 INFO L226 Difference]: Without dead ends: 11496 [2019-11-15 22:23:28,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:23:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11496 states. [2019-11-15 22:23:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11496 to 8393. [2019-11-15 22:23:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8393 states. [2019-11-15 22:23:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8393 states to 8393 states and 18894 transitions. [2019-11-15 22:23:29,073 INFO L78 Accepts]: Start accepts. Automaton has 8393 states and 18894 transitions. Word has length 94 [2019-11-15 22:23:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:29,074 INFO L462 AbstractCegarLoop]: Abstraction has 8393 states and 18894 transitions. [2019-11-15 22:23:29,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8393 states and 18894 transitions. [2019-11-15 22:23:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:29,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:29,083 INFO L380 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] [2019-11-15 22:23:29,083 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:29,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1341344527, now seen corresponding path program 1 times [2019-11-15 22:23:29,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:29,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375428998] [2019-11-15 22:23:29,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:29,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:29,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:29,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375428998] [2019-11-15 22:23:29,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:29,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:23:29,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876747515] [2019-11-15 22:23:29,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:29,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:29,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:29,218 INFO L87 Difference]: Start difference. First operand 8393 states and 18894 transitions. Second operand 7 states. [2019-11-15 22:23:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:29,449 INFO L93 Difference]: Finished difference Result 10899 states and 24458 transitions. [2019-11-15 22:23:29,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:23:29,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 22:23:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:29,462 INFO L225 Difference]: With dead ends: 10899 [2019-11-15 22:23:29,462 INFO L226 Difference]: Without dead ends: 10899 [2019-11-15 22:23:29,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:23:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10899 states. [2019-11-15 22:23:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10899 to 7827. [2019-11-15 22:23:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7827 states. [2019-11-15 22:23:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7827 states to 7827 states and 17490 transitions. [2019-11-15 22:23:29,591 INFO L78 Accepts]: Start accepts. Automaton has 7827 states and 17490 transitions. Word has length 94 [2019-11-15 22:23:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:29,591 INFO L462 AbstractCegarLoop]: Abstraction has 7827 states and 17490 transitions. [2019-11-15 22:23:29,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7827 states and 17490 transitions. [2019-11-15 22:23:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:29,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:29,600 INFO L380 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] [2019-11-15 22:23:29,601 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 496872656, now seen corresponding path program 1 times [2019-11-15 22:23:29,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:29,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50773018] [2019-11-15 22:23:29,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:29,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:29,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:29,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50773018] [2019-11-15 22:23:29,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:29,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:29,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888250867] [2019-11-15 22:23:29,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:29,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:29,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:29,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:29,730 INFO L87 Difference]: Start difference. First operand 7827 states and 17490 transitions. Second operand 6 states. [2019-11-15 22:23:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:29,817 INFO L93 Difference]: Finished difference Result 8993 states and 19782 transitions. [2019-11-15 22:23:29,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:23:29,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 22:23:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:29,827 INFO L225 Difference]: With dead ends: 8993 [2019-11-15 22:23:29,827 INFO L226 Difference]: Without dead ends: 8993 [2019-11-15 22:23:29,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2019-11-15 22:23:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 7690. [2019-11-15 22:23:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7690 states. [2019-11-15 22:23:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7690 states to 7690 states and 16956 transitions. [2019-11-15 22:23:29,941 INFO L78 Accepts]: Start accepts. Automaton has 7690 states and 16956 transitions. Word has length 94 [2019-11-15 22:23:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:29,942 INFO L462 AbstractCegarLoop]: Abstraction has 7690 states and 16956 transitions. [2019-11-15 22:23:29,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7690 states and 16956 transitions. [2019-11-15 22:23:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:23:29,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:29,952 INFO L380 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] [2019-11-15 22:23:29,952 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:29,953 INFO L82 PathProgramCache]: Analyzing trace with hash 854133456, now seen corresponding path program 1 times [2019-11-15 22:23:29,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:29,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124361725] [2019-11-15 22:23:29,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:29,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:29,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:30,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124361725] [2019-11-15 22:23:30,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:30,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:30,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292415669] [2019-11-15 22:23:30,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:30,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:30,082 INFO L87 Difference]: Start difference. First operand 7690 states and 16956 transitions. Second operand 6 states. [2019-11-15 22:23:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:30,260 INFO L93 Difference]: Finished difference Result 7474 states and 16344 transitions. [2019-11-15 22:23:30,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:23:30,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 22:23:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:30,269 INFO L225 Difference]: With dead ends: 7474 [2019-11-15 22:23:30,269 INFO L226 Difference]: Without dead ends: 7474 [2019-11-15 22:23:30,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:23:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7474 states. [2019-11-15 22:23:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7474 to 4852. [2019-11-15 22:23:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2019-11-15 22:23:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 10709 transitions. [2019-11-15 22:23:30,359 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 10709 transitions. Word has length 94 [2019-11-15 22:23:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:30,360 INFO L462 AbstractCegarLoop]: Abstraction has 4852 states and 10709 transitions. [2019-11-15 22:23:30,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 10709 transitions. [2019-11-15 22:23:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:23:30,365 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:30,366 INFO L380 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] [2019-11-15 22:23:30,369 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1224617826, now seen corresponding path program 1 times [2019-11-15 22:23:30,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:30,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272483323] [2019-11-15 22:23:30,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:30,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:30,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:30,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272483323] [2019-11-15 22:23:30,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:30,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:23:30,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585517463] [2019-11-15 22:23:30,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:23:30,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:23:30,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:23:30,560 INFO L87 Difference]: Start difference. First operand 4852 states and 10709 transitions. Second operand 9 states. [2019-11-15 22:23:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:31,015 INFO L93 Difference]: Finished difference Result 5819 states and 12713 transitions. [2019-11-15 22:23:31,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:23:31,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-15 22:23:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:31,020 INFO L225 Difference]: With dead ends: 5819 [2019-11-15 22:23:31,020 INFO L226 Difference]: Without dead ends: 5819 [2019-11-15 22:23:31,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:23:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2019-11-15 22:23:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 5613. [2019-11-15 22:23:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-11-15 22:23:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 12317 transitions. [2019-11-15 22:23:31,075 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 12317 transitions. Word has length 96 [2019-11-15 22:23:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:31,075 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 12317 transitions. [2019-11-15 22:23:31,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:23:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 12317 transitions. [2019-11-15 22:23:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:23:31,080 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:31,080 INFO L380 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] [2019-11-15 22:23:31,080 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:31,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:31,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2112121507, now seen corresponding path program 1 times [2019-11-15 22:23:31,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:31,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591766367] [2019-11-15 22:23:31,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:31,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:31,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:31,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591766367] [2019-11-15 22:23:31,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:31,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:23:31,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971555467] [2019-11-15 22:23:31,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:23:31,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:23:31,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:23:31,253 INFO L87 Difference]: Start difference. First operand 5613 states and 12317 transitions. Second operand 10 states. [2019-11-15 22:23:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:31,774 INFO L93 Difference]: Finished difference Result 22827 states and 50531 transitions. [2019-11-15 22:23:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:23:31,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-15 22:23:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:31,786 INFO L225 Difference]: With dead ends: 22827 [2019-11-15 22:23:31,786 INFO L226 Difference]: Without dead ends: 13242 [2019-11-15 22:23:31,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:23:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2019-11-15 22:23:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 5359. [2019-11-15 22:23:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5359 states. [2019-11-15 22:23:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 11655 transitions. [2019-11-15 22:23:31,872 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 11655 transitions. Word has length 96 [2019-11-15 22:23:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:31,872 INFO L462 AbstractCegarLoop]: Abstraction has 5359 states and 11655 transitions. [2019-11-15 22:23:31,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:23:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 11655 transitions. [2019-11-15 22:23:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:23:31,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:31,877 INFO L380 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] [2019-11-15 22:23:31,877 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:31,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1291408967, now seen corresponding path program 2 times [2019-11-15 22:23:31,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:31,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008146278] [2019-11-15 22:23:31,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:31,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:23:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:23:31,972 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:23:31,972 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:23:32,124 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:23:32,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:23:32 BasicIcfg [2019-11-15 22:23:32,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:23:32,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:23:32,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:23:32,127 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:23:32,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:50" (3/4) ... [2019-11-15 22:23:32,130 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:23:32,272 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3cb9a62-f3a5-424b-94cf-dbe650246da5/bin/uautomizer/witness.graphml [2019-11-15 22:23:32,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:23:32,275 INFO L168 Benchmark]: Toolchain (without parser) took 43985.18 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 944.8 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:23:32,275 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:23:32,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:32,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.22 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:32,276 INFO L168 Benchmark]: Boogie Preprocessor took 34.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:23:32,276 INFO L168 Benchmark]: RCFGBuilder took 838.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:32,277 INFO L168 Benchmark]: TraceAbstraction took 42109.71 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:23:32,277 INFO L168 Benchmark]: Witness Printer took 146.06 ms. Allocated memory is still 4.5 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:32,279 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 783.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.22 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.77 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 838.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42109.71 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 146.06 ms. Allocated memory is still 4.5 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 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] [L704] 0 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] [L706] 0 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] [L707] 0 _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] [L708] 0 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] [L709] 0 _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] [L710] 0 _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] [L711] 0 _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] [L712] 0 _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] [L713] 0 _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] [L714] 0 _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] [L715] 0 _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] [L716] 0 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}] [L717] 0 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] [L718] 0 _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] [L719] 0 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] [L720] 0 _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] [L721] 0 _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] [L722] 0 _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] [L801] 0 pthread_t t1093; 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] [L802] FCALL, FORK 0 pthread_create(&t1093, ((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] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!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] [L803] 0 pthread_t t1094; 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] [L731] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L732] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L733] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 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] [L740] EXPR 1 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] [L804] FCALL, FORK 0 pthread_create(&t1094, ((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] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 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=5, 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] [L767] EXPR 2 !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=5, 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] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used 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=5, weak$$choice2=1, x=2, y=1, z=1, 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] [L767] 2 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) [L768] EXPR 2 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=5, 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] [L768] 2 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)) [L769] EXPR 2 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=5, 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] [L769] 2 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)) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 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 [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 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=5, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L744] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 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 [L747] 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=5, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 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=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=5, 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))=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=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 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)) [L771] EXPR 2 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=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=5, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 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)) [L772] EXPR 2 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=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=5, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 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)) [L773] EXPR 2 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=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=5, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 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)) [L774] 2 __unbuffered_p1_EBX = z 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=5, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 2 z$flush_delayed ? z$mem_tmp : z 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=5, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z = z$flush_delayed ? z$mem_tmp : z [L776] 2 z$flush_delayed = (_Bool)0 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=5, 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] [L779] EXPR 2 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=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=5, 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] [L779] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z 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=5, 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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L779] EXPR 2 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=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=5, 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_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] [L779] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_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=5, 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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] EXPR 2 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=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=5, 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_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] [L781] 2 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 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 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=5, 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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] EXPR 2 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=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=5, 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_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] [L783] 2 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 [L786] 2 __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=5, 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] [L806] 0 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=5, 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] [L810] EXPR 0 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=5, 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] [L810] EXPR 0 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=5, 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] [L810] EXPR 0 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=5, 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] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] EXPR 0 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=5, 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] [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] EXPR 0 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=5, 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] [L812] 0 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 [L813] EXPR 0 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=5, 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] [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L814] EXPR 0 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=5, 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] [L814] 0 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 [L817] 0 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=5, 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 0 !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=5, 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] 0 __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=5, 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, 219 locations, 3 error locations. Result: UNSAFE, OverallTime: 41.9s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9526 SDtfs, 9783 SDslu, 22271 SDs, 0 SdLazy, 7751 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 101 SyntacticMatches, 19 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 89774 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2571 NumberOfCodeBlocks, 2571 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2441 ConstructedInterpolants, 0 QuantifiedInterpolants, 500631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...